Author: Robert Hyatt
Date: 12:15:21 07/22/04
Go up one level in this thread
On July 22, 2004 at 02:40:15, Alvaro Jose Povoa Cardoso wrote: >Hi, >Could someone please show me some simple code for executing a search in >breadth-first manner? > >Thanks in advance, >Alvaro Cardoso Be careful when asking about breadth-first or depth-first. You can get into an incredible discussion with _one_ of CCC's members. The basic idea is that you generate the ply-1 moves and make them, adding the resulting positions to a list. Now, for every position in the list, you generate and make moves and then add these positions to another list. For every position in that list repeat again. The problem with breadth-first is the storage requirement. You store the complete 3-ply tree so that you take each 3-ply position, generate and make moves to produce the complete 4-ply tree. Won't work very well with chess of course.
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.