Author: Paul
Date: 15:08:18 04/29/01
Go up one level in this thread
On April 29, 2001 at 17:45:28, leonid wrote: >Thanks, Paul, for explanation! But what is the objective for those pushes into >stack? This is what I can't understand. Probably you save all moves for each ply >before doing something in the ply. If it is so, this correspond to my saving of >the legal moves, in every ply, before ply start seeing one move (node) after >other. I have to save the moves on each ply because I search "depth-first". Eg if I do a search 2 plies deep: I generate all moves for ply=0, execute one of those moves, generate all ply=1 moves and evaluate the positions after each of these moves. But then I still have to execute all the other possible ply=0 moves that I've generated ... and how could I do that if I hadn't stored/pushed them onto the stack? >In each ply of my program initial position is saved into special chain as well >as all legal moves. After deposing each legal move (node) on the bord this >permit to come back to initial position and go into seeing next move. This is >done if previous move was not enough for finding necessary response for that >ply. Sounds (almost) exactly like what I do, so why the 200 move limit in the generator? If you store those moves directly in a stack you don't have to have a limit? Paul
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.