Author: Severi Salminen
Date: 09:13:30 04/29/00
Go up one level in this thread
Hi! >You could also use the node counts for each move at the root to >reorder your moves after each iteration. Good idea. I just programmed a simple ordering (captures first, then others) and it made the AB (as expected) much faster. I'll have to try that node ordering. What would be the simplest way (in assembler) to sort the moves? It is not so trivial task when you think of it :( Severi
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.