Author: Tord Romstad
Date: 23:41:49 01/18/04
Go up one level in this thread
On January 18, 2004 at 11:41:55, Benny Antonsson wrote: >Excuse my stupid question, but what is PN search ? Proof number search, as Russell said. Briefly explained, it is a game tree search algorithm which evaluates each leaf node as "success" or "failure", and uses this to decide whether there is a forced way to "success" from the root position. The algorithm is often extremely fast at finding forced wins. It has been used to solve games like Connect-4 and "luffarschack" (sorry, I don't know the English name), and is also used (I think) in many mate solving programs. It is also very effective in games like suicide chess, where there are lots of extremely long forced wins. Tord
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.