Author: Michael Henderson
Date: 22:35:02 10/11/04
Go up one level in this thread
On October 11, 2004 at 23:08:56, Henry Hongdoyo wrote: >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. I assume you mean you have Max and Min functions instead of a NegaMax function? In that case use: for Max: val = (alpha, alpha + 1) if (val >= beta) return val for Min: val = (beta - 1, beta) if (val <= alpha) return val Michael > >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.