Problem 2565. Determine the Result of a Move in Reversi

Created by Ned Gulley

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>Note: This is closely related to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/2538-find-the-next-legal-move-in-reversi\"><w:r><w:t>Problem 2538</w:t></w:r></w:hyperlink><w:r><w:t>, Find the Next Legal Move in Reversi.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Reversi\"><w:r><w:t>Reversi</w:t></w:r></w:hyperlink><w:r><w:t>, also known as Othello, is a game in which reversible white/black chips are placed on a grid. The goal is to have the most pieces once the board is full (i.e. there are no more legal moves). A move, to be legal, must flip at least one opponent's chip by flanking it. \"Flanking\" occurs by surrounding a line of opposing chips with two of your own. It can occur on straight lines and diagonals.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>We represent a small 4x4 board this way, with 0 for empty squares, 1 for black chips, and 2 for white chips,</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ [ 0 0 0 0\n 0 1 2 0\n 0 2 1 0 \n 0 0 0 0 ]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Now assume black now moves where the asterisk </w:t></w:r><w:r><w:t>(*</w:t></w:r><w:r><w:t>) is placed. This is column-wise matrix index position 14.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ [ 0 0 0 0\n 0 1 2 *\n 0 2 1 0 \n 0 0 0 0 ]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your Cody challenge is to determine the state of the board once the appropriate chips have been flipped over. In this case the correct answer would be</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ [ 0 0 0 0\n 0 1 1 1\n 0 2 1 0 \n 0 0 0 0 ]]]></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=\"text\"/></w:pPr><w:r><w:t>For the inputs boardIn, side, and move</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ boardIn = ...\n [ 0 0 0 0 0\n 0 1 1 2 2 \n 0 2 1 1 0\n 0 0 2 1 0 \n 0 0 0 0 0 ]\n side = 1 (black)\n move = 9 (matrix index of black's next move)]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The correct answer is</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ boardOut = ...\n [ 0 0 0 0 0\n 0 1 1 2 2 \n 0 1 1 1 0\n 0 1 1 1 0 \n 0 0 0 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>"}]}

Note: This is closely related to <a href = "http://www.mathworks.com/matlabcentral/cody/problems/2538-find-the-next-legal-move-in-reversi">Problem 2538</a>, Find the Next Legal Move in Reversi.<a href = "http://en.wikipedia.org/wiki/Reversi">Reversi</a>, also known as Othello, is a game in which reversible white/black chips are placed on a grid. The goal is to have the most pieces once the board is full (i.e. there are no more legal moves). A move, to be legal, must flip at least one opponent's chip by flanking it. "Flanking" occurs by surrounding a line of opposing chips with two of your own. It can occur on straight lines and diagonals.We represent a small 4x4 board this way, with 0 for empty squares, 1 for black chips, and 2 for white chips,<pre> [ 0 0 0 0
 0 1 2 0
 0 2 1 0 
 0 0 0 0 ]</pre>Now assume black now moves where the asterisk (*) is placed. This is column-wise matrix index position 14.<pre> [ 0 0 0 0
 0 1 2 *
 0 2 1 0 
 0 0 0 0 ]</pre>Your Cody challenge is to determine the state of the board once the appropriate chips have been flipped over. In this case the correct answer would be<pre> [ 0 0 0 0
 0 1 1 1
 0 2 1 0 
 0 0 0 0 ]</pre>ExampleFor the inputs boardIn, side, and move<pre> boardIn = ...
 [ 0 0 0 0 0
 0 1 1 2 2 
 0 2 1 1 0
 0 0 2 1 0 
 0 0 0 0 0 ]
 side = 1 (black)
 move = 9 (matrix index of black's next move)</pre>The correct answer is<pre> boardOut = ...
 [ 0 0 0 0 0
 0 1 1 2 2 
 0 1 1 1 0
 0 1 1 1 0 
 0 0 0 0 0 ]</pre>

Note: This is closely related to <http://www.mathworks.com/matlabcentral/cody/problems/2538-find-the-next-legal-move-in-reversi Problem 2538>, Find the Next Legal Move in Reversi.

<http://en.wikipedia.org/wiki/Reversi Reversi>, also known as Othello, is a game in which reversible white/black chips are placed on a grid. The goal is to have the most pieces once the board is full (i.e. there are no more legal moves). A move, to be legal, must flip at least one opponent's chip by flanking it. "Flanking" occurs by surrounding a line of opposing chips with two of your own. It can occur on straight lines and diagonals.

We represent a small 4x4 board this way, with 0 for empty squares, 1 for black chips, and 2 for white chips,

[ 0 0 0 0
   0 1 2 0
   0 2 1 0 
   0 0 0 0 ]

Now assume black now moves where the asterisk (*) is placed. This is column-wise matrix index position 14.

[ 0 0 0 0
   0 1 2 *
   0 2 1 0 
   0 0 0 0 ]

Your Cody challenge is to determine the state of the board once the appropriate chips have been flipped over. In this case the correct answer would be

[ 0 0 0 0
   0 1 1 1
   0 2 1 0 
   0 0 0 0 ]

Example

For the inputs boardIn, side, and move

boardIn = ...
   [ 0 0 0 0 0
     0 1 1 2 2 
     0 2 1 1 0
     0 0 2 1 0 
     0 0 0 0 0 ]
 side = 1 (black)
 move = 9 (matrix index of black's next move)

The correct answer is

boardOut = ...
   [ 0 0 0 0 0
     0 1 1 2 2 
     0 1 1 1 0
     0 1 1 1 0 
     0 0 0 0 0 ]

Solve

Solution Stats

46 Solutions
18 Solvers

Last Solution submitted on Oct 08, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 498034

1 Comment

1 Comment

Ned Gulley on 20 Jan 2015

This code is referenced in the following blog post: http://blogs.mathworks.com/community/2015/01/19/robot-game-playing-in-matlab-part-2/

Problem Recent Solvers18

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 2565. Determine the Result of a Move in Reversi

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers18

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Problem 2565. Determine the Result of a Move in Reversi

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers18

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Players