Skip to content

Commit 26d46e5

Browse files
Daniel WhiteDaniel White
authored andcommitted
Minor README fixes.
1 parent 97532f8 commit 26d46e5

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,15 +11,15 @@ position by a sequence of legal moves. It includes the full game state. While it
1111
may be arbitrary, we require a standard protocol because one could imagine a
1212
pathological protocol where the GUI sends a list of legal moves, from which the
1313
engine then selects one. This would reduce the exercise to writing the smallest
14-
program which repeatedly choose the first move (say).
14+
program which repeatedly chooses the first move (say).
1515

1616
For the first criteria we use the UCI protocol, in particular the following
1717
commands are used: 'uci'/'uciok', 'isready'/'readyok', 'position' and
1818
'go'/'bestmove'. While iota does obey the second requirement - so accepting
1919
en-passent captures, under-promotions and castling - it will never castle
2020
itself. Note that this is not a violation because if we have the option to
2121
castle, then we always have the alternatives of simply moving either one of the
22-
king and rook toward the other.
22+
king or rook toward the other.
2323

2424
## Acknowledgements
2525
I would like to give thanks to H. G. Muller (HGM) both for his engine MicroMax

0 commit comments

Comments
 (0)