Author: Peter Alloysius
Date: 21:05: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 ? maybe it's about your move ordering, if your move ordering poor, then negascout spend much more time in research. Have you calculate how many fail high at first node? It should around 90% >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 ? that should be no problem. > >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 ? no, I don't said that. I said if your engine make stupid move (like losing material capture) then there's high probability that your quiescene has problem.
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.