Results of SAT-CMS

Message boards : News : Results of SAT-CMS

To post messages, you must log in.

Oleg Zaikin
Volunteer moderator
Project developer
Project tester
Volunteer developer
Volunteer tester
Project scientist
Help desk expert

Send message
Joined: 20 Jul 20
Posts: 4
Credit: 2,487
RAC: 0
Message 1409 - Posted: 27 Sep 2020, 17:30:31 UTC
Last modified: 28 Sep 2020, 6:53:11 UTC

As a result of the SAT-CMS experiment, 29 pairs of orthogonal diagonal Latin squares (ODLS) of order 10 were found. 2 cell mapping schemas (CMS) were used for this purpose. 18 found pairs are based on the first CMS, the remaining 11 pairs are based on the second one. CMS is in fact a relation between 2 Latin square from an orthogonal pair: for each element of the first square it shows where this element should be placed in the second square. Therefore, one can effectively construct the second square from a pair given the first square. The computing application was based on the CDCL algorithm aimed at solving the Boolean satisfiability problem (SAT). For each studied CMS, we first reduced a problem of finding pairs of ODLS of order 10 (that match the CMS) to SAT. Then, the obtained SAT problem was splitted into subproblems which in turn formed workunits. Finally, from found satisfying assignments (solutions of the SAT problems) we constructed the corresponding pairs of ODLS. All the found pairs are listed here. We are very grateful to all the crunchers who took part in the experiment!
ID: 1409 · Rating: 0 · rate: Rate + / Rate - Report as offensive    Reply Quote

Send message
Joined: 4 Oct 17
Posts: 5
Credit: 20,559,712
RAC: 0
Message 1425 - Posted: 1 Oct 2020, 10:26:17 UTC - in response to Message 1409.  

очень интересно ! Уверен, что многие из нас надеются продолжить вместе с новым проектом.
ID: 1425 · Rating: 0 · rate: Rate + / Rate - Report as offensive    Reply Quote

Message boards : News : Results of SAT-CMS

©2021 The searchers team, Karelian Research Center of the Russian Academy of Sciences