Author: Dieter Buerssner
Date: 16:11:13 05/02/03
Go up one level in this thread
On May 02, 2003 at 19:03:25, Dieter Buerssner wrote: > While this is less effective for huge search problems I meant sorting problems (instead of search problems). Or in other words, sorting the whole move list can be done more efficiently, than by a selection sort. But in a chess engine, you often do not need the whole list sorted, which makes the selection search method attractive. Dieter
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.