Author: Tord Romstad
Date: 09:29:18 10/07/03
Go up one level in this thread
On October 07, 2003 at 08:27:40, Anthony Cozzie wrote: >On October 06, 2003 at 22:24:18, macaroni wrote: > >>What are the usualy ways of pruning the quiescent search. I don't use bitboard, >>so that cuts out some stuff, and makes a swap function heaps harder. At the >>moment, I just say a capture is no good if it doesn't increase the score above >>alpha-margin (50 centipawns for position stuff at the moment). Are there any >>other simple, or sort of simple ways? >>Cheers > >1. You stepped on a mine here. Your "I don't use bitboards, because ____" will >start a huge flamewar. Mark my words. He didn't say "I don't use bitboards, because ____", just "I don't use bitboards". Hence, no flamewar. :-) >2. When you say "swap-off" function, I think you mean a capture evaluator. >However, there is no reason you can't write a capture evaluator without >bitboards (actually, there isn't really a good way to do it _with_ bitboards >IMO). I agree. Writing a static exchange evaluator is more or less equally difficult in all common board representations. Tord
This page took 0.01 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.