Chessboard

Vctor E. M
ujica-Marquez
April 4, 2016
The movements of a piece on the chessboard can be programmed like
a nondeterministic finite automata, but in this case it will be shown
as a deterministic finite automata.

Figure 1: Chessboard

Supposing that each state is a square, the inputs would be R (move

to an adjacent RED square) and B (move to an adjacent BLACK
square). Finally the START state and the FINAL state are in opposite corners.
The table below shows the transition subsets of states.
{1}
{2,4}
{5}
{2,4,6,8}
{1,3,5,7}
?{1,3,7,9}
?{1,3,5,7,9}

{2,4}
{2,4,6,8}
{2,4,6,8}
{2,4,6,8}
{2,4,6,8}
{2,4,6,8}
{2,4,6,8}

{5}
{1,3,5,7}
{1,3,7,9}
{1,3,5,7,9}
{1,3,5,7,9}
{5}
{1,3,5,7,9}