Author: Henry Hongdoyo
Date: 20:08:56 10/11/04
Why my Negascout spend more time compare to my alphabeta ? i don't use Negamax version on my negascout. i use max-min level because some reason. Can i use negascout optimal in that condition ? I need spesifik pseudo code for Negascout combine Transposition table, fail soft, and max-min condition (like alphabeta). Please.. because pseudo code Negascout that i have don't use max-min condition. i confuse to implemented that in the min condition. My friend say that the problem of my Negascout maybe in the quiescence. But i dont understand why ?. can you give me pseudo code Quiescence for Negascout ? Thanks
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.