Author: leonid
Date: 07:59:24 10/04/01
Go up one level in this thread
On October 04, 2001 at 01:52:13, Timo Saari wrote: >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 you explain what was your chess problem program? When it was written and how? What language you use and what are your plans about your next program as hardware and system expectation? I think that I can say about mate solver something that I saw before I started writing it. Doing it was nothing more but putting into work something that look obvious. Will say you anyway, maybe it will be useful. 1) Checking moves goes first. 2) Specilized writing of two plys. When you have to find mate just two plys deep: a) attacking side produce only checking moves. b) responding side should find only one legal move to stop search. Expect very soon see your program at work! Cheers, Leonid Liberman. >Can somebody point me to any existing information on abovementiond topics? > >Any help appreciated. > >Timo
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.