Problem 44658. Kurosu solver

Created by HH

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is related to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/44657-kurosu-checker\"><w:r><w:t>Problem 44657</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The game of Kurosu is simple. A square grid contains cells that can be filled with either a 'X' or an 'O', similarly to a tic-tac-toe board. Game rules are as follows:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>1. The game is played on a 6x6 board.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>2. Each row and each column must contain exactly 3 'X's and 3 'O's.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>3. Only 2 'X's or 'O's can be placed consecutively, either in a row or in a column.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>4. Diagonals are of no importance.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>In this problem, given a partially filled Kurosu board, b0, return b1, an array of the same size, representing the solved board, or an empty array if there is no valid solution. 'X's and 'O's are represented by 1s and 0s, respectively. An empty cell is represented by -1.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[b0 = [-1 -1 -1 0 -1 -1\n -1 -1 -1 0 0 -1\n -1 -1 -1 -1 -1 -1\n -1 -1 0 -1 -1 1\n -1 -1 -1 -1 1 1\n -1 -1 1 -1 -1 -1];\n\nb1 = [ 1 1 0 0 1 0\n 0 1 1 0 0 1\n 1 0 0 1 1 0\n 0 1 0 1 0 1\n 0 0 1 0 1 1\n 1 0 1 1 0 0];]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This problem is related to <a href = "https://www.mathworks.com/matlabcentral/cody/problems/44657-kurosu-checker">Problem 44657</a>.The game of Kurosu is simple. A square grid contains cells that can be filled with either a 'X' or an 'O', similarly to a tic-tac-toe board. Game rules are as follows:1. The game is played on a 6x6 board.2. Each row and each column must contain exactly 3 'X's and 3 'O's.3. Only 2 'X's or 'O's can be placed consecutively, either in a row or in a column.4. Diagonals are of no importance.In this problem, given a partially filled Kurosu board, b0, return b1, an array of the same size, representing the solved board, or an empty array if there is no valid solution. 'X's and 'O's are represented by 1s and 0s, respectively. An empty cell is represented by -1.Example:<pre class="language-matlab">b0 = [-1 -1 -1 0 -1 -1
 -1 -1 -1 0 0 -1
 -1 -1 -1 -1 -1 -1
 -1 -1 0 -1 -1 1
 -1 -1 -1 -1 1 1
 -1 -1 1 -1 -1 -1];
</pre><pre class="language-matlab">b1 = [ 1 1 0 0 1 0
 0 1 1 0 0 1
 1 0 0 1 1 0
 0 1 0 1 0 1
 0 0 1 0 1 1
 1 0 1 1 0 0];
</pre>

This problem is related to <https://www.mathworks.com/matlabcentral/cody/problems/44657-kurosu-checker Problem 44657>.

The game of Kurosu is simple. A square grid contains cells that can be filled with either a 'X' or an 'O', similarly to a tic-tac-toe board. Game rules are as follows:

1. The game is played on a 6x6 board.

2. Each row and each column must contain exactly 3 'X's and 3 'O's.

3. Only 2 'X's or 'O's can be placed consecutively, either in a row or in a column.

4. Diagonals are of no importance.

In this problem, given a partially filled Kurosu board, b0, return b1, an array of the same size, representing the solved board, or an empty array if there is no valid solution. 'X's and 'O's are represented by 1s and 0s, respectively. An empty cell is represented by -1.

Example:

b0 = [-1 -1 -1  0 -1 -1
        -1 -1 -1  0  0 -1
        -1 -1 -1 -1 -1 -1
        -1 -1  0 -1 -1  1
        -1 -1 -1 -1  1  1
        -1 -1  1 -1 -1 -1];

b1 = [ 1  1  0  0  1  0
         0  1  1  0  0  1
         1  0  0  1  1  0
         0  1  0  1  0  1
         0  0  1  0  1  1
         1  0  1  1  0  0];

Solve

Solution Stats

40 Solutions
8 Solvers

Last Solution submitted on Aug 31, 2022

Last 200 Solutions

Problem Comments

6 Comments

6 Comments

Show 3 older comments

Michael on 1 Jun 2018

Either your problem statement is incomplete, or your test suite is ill-formed.

For some of the problems, the solution is not unique, but your test suite fails for solutions other than your own. If there is some further requirement that would make your solutions unique, it should be stated.

For the last test, the input is a valid solved Kurosu board, but you expect us to say that there is no solution to that board. If this was intended (i.e. you meant the "partially filled" statement to be a requirement on the input), then it should have been specified.

Tim on 4 Jun 2018

The last test board has three consecutive zeros in a column, so it is invalid, and the others do appear to have a unique solution.

HH on 17 Jun 2018

Thank you for the comments. I've updated the test suite to check for non-unique solutions, just in case.

Michael on 18 Jun 2018

It looks like I missed restriction 3 in the description. I retract my comments. Great problem!

Jean-Marie Sainthillier on 6 Jul 2018

Good problem !
Extraterrestrial solution from Tim. This code must be taught in school.

HH on 8 Jul 2018

Great solution indeed, thanks for the comment Jean-Marie. That's why I felt compelled to rescore and eliminate your backdoor solution. Sorry, but nice catch.

Solution Comments

Solution 1721263

2 Comments

2 Comments

Alfonso Nieto-Castanon on 5 Feb 2019

Cody seemed to be having a hard time creating a ~2Gb variable here (commented-out line in the this solution code) @CodyTeam: would it be possible (in general) to increase the servers available memory a bit? (of course this is not a big deal, we can always try to work around that)

Aditya Jain on 5 Feb 2019

Hi Alfonso,

Thank you for your feedback. I will capture this as an enhancement request to discuss further with the Cody Team :)

Thanks again.

Problem Recent Solvers8

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 44658. Kurosu solver

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers8

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Problem 44658. Kurosu solver

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers8

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Players