Author: Dan Andersson
Date: 04:57:01 06/02/02
Go up one level in this thread
I have to say that Pn search will probably be more helpful to prove perpetual attacks. But for the graph problem. A hybrid approach will probaly go a long way here. To get a reasonable memory footprint Pn^2 is used. And solved positions are stored at the end of the tree array and grows backwards in a binary sorted tree. That will keep the memory under control. The main problem is to decide what solved positions to save in the array to reduce work. What I mean when I say that depth is the limiting factor is mainly the fact that when you have a king and several other non sliding pieces that interact. Then the maximum 'distance' , as defined as the number of discrete piece moves needed to reach an unique position, will rapdily increase for the state space. The measure or maximum distance coupled with the number of pieces and states/positions for the individual pieces would probably give a good measure on wether search or enumeration is preferable. MvH Dan Andersson
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.