Computer Chess Club Archives




Subject: Chess problem solving

Author: Timo Saari

Date: 22:52:13 10/03/01

I am rewriting an old chess problem solver program and as of now it can solve
normal mate in n moves type problems when n is not too large. It does a brute
force type search and uses a hash table and killer heuristic. I assume that in
order to make it reasonably fast with more challenging problems (n>6) I need to
implement at least move ordering and perhaps special handling of plies near the
leaves of the search tree.

Can somebody point me to any existing information on abovementiond topics?

Any help appreciated.


This page took 0.03 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.