Author: leonid
Date: 17:12:33 04/29/01
Go up one level in this thread
On April 29, 2001 at 18:08:18, Paul wrote: >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? Now it is clear! >>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? It is not that generator impose the limit. There I can easely generate 300 moves right now and save them in special chain. For two colors, I should asign some 2400 bytes. (300 moves for black plus 300 moves for whites) * 4 bytes for each move = 2400 bytes. Problem is in the limitation of those chains of moves that must be saved for each ply. In DOS, where you want to put all your basic data just in one 64k segment, it could be a problem. With 32 bits offsets in Windows and Linux, no more. Leonid. >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.