Author: Bruce Moreland
Date: 17:24:54 09/20/98
Go up one level in this thread
On September 20, 1998 at 19:31:36, John Coffey wrote: >We all know that searching 1 ply, 2ply, 3ply, 4ply etc produces faster >results than just searching 4 ply by itself because the move odering >improves the efficiency of the alpha-beta pruning. > >But ... > >Has this approach ever been used above the base of the tree? i.e. If >I am doing a seven ply search and I make the first move for white and >I am searching the black responses, at this point would it pay to do >a 1ply, 2ply, 3ply, 4ply, 5 ply, and finally a 6 ply search? > >If so, then the number of sub-searches would get quite high. Part of the charm of computer chess programming is that you will have a lot of great ideas that you will find out later that someone else had and rejected in 1968 or something. This is one of them. You can try this, I predict you will find that you go slower by any way of measuring, but you might be able to find some way to make this work for you. I know that some people do iterative deepening inside the tree in some places, but I don't know of anyone who does it in every case. bruce
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.