Rakesearch

[[File:{{#setmainimage:Squares.png}}|alt=logo image|center|frameless]]

RakeSearch is a BOINC based volunteer computing project that needs your help to process diagonal Latin squares.

Why RakeSearch?

• why this topic/object of study?

Goal

Investigate the diagonal Latin squares space.

Methods

The enormous size of the diagonal Latin squares space makes it unfeasible to enumerate all its objects in reasonable time. Sophisticated search methods and the BOINC platform are essential to meet the computational requirements.

RakeSearch implements an application that picks up separate pairs of mutually orthogonal DLS, which allows reconstruction of full graphs of their orthogonality.

Source code:

• diagonal Latin squares of Rank 9 (R9)
• diagonal Latin squares of Rank 10 (R10)

Project team / Sponsors

Natalia Nikitina. hoarfrost. The searchers team, Karelian Research Center of the Russian Academy of Sciences.

Scientific results

https://rake.boincfast.ru/rakesearch/publications.php

https://rake.boincfast.ru/rakesearch/graphs.html

Scientific publications

1. Vatutin, Eduard, Oleg Zaikin, Maxim Manzyuk and Natalia Nikitina. Searching for Orthogonal Latin Squares via Cells Mapping and BOINC-Based Cube-and-Conquer. (2021). DOI: 10.1007/978-3-030-92864-3_38.
2. Vatutin, Eduard and Alexey Belyshev. Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality. (2020). DOI: 10.1007/978-3-030-64616-5_50.
3. Ivashko, Evgeny and Natalia Nikitina. Replication of “Tail” Computations in a Desktop Grid Project. (2020). DOI: 10.1007/978-3-030-64616-5_52.
4. Manzyuk, Maxim, Natalia Nikitina and Eduard Vatutin. Start-up and the Results of the Volunteer Computing Project RakeSearch. (2019). DOI: 10.1007/978-3-030-36592-9_59.