Commit acfc7169 authored by simonpj's avatar simonpj

[project @ 2004-08-10 11:39:00 by simonpj]

Add README
parent 873bc504
Mate solves chess end-game problems of the form "White to move
and mate in N". For example problems (standard input) and
solutions (standard output) see *.in and *.out.
The program works by brute-force search in an AND-OR game-tree
of depth 2N-1 in which nodes represent board positions and
succession is by legal move.
Here are approximate timings for some of the problems, when
Mate is compiled to byte-code by nhc98 and run on a 700MHz PC
(all times in seconds):
ellerman 3
shinkman 70
fridlizius 140
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment