Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: improvement in least number of moves

Author: John Coffey

Date: 12:00:12 03/24/00

Go up one level in this thread


Good move ordering allows Alpha Beta to run much faster.  The reason why you do
iterative deepening is so that you can sort the moves.  i.e search 1 ply and
sort and then 2 ply and sort and then 3 ply and sort.  This will be faster than
searching 3 ply only.

If you use transposition tables then iterative deepening allows you too look up
posiitons that you have looked at before in the smaller searches.   This means
that you can get good move ordering beyond the base of your tree.  You look to
the transposition table to find the "best" move and try that first.

John Coffey



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.