Author: Antonio Dieguez
Date: 11:26:52 06/18/05
Go up one level in this thread
On June 18, 2005 at 14:15:31, Vasik Rajlich wrote: >On June 18, 2005 at 12:25:00, Dieter Buerssner wrote: > >>Hi Vaskik, >> >>one example, what can go wrong for fail soft. >> >>int qsearch(int alpha, int beta) >>{ >> /* Fail soft version - extremly simplified */ >> int best, score; >> best = eval(); >> if (best > alpha) >> { >> if (best >= beta) >> return best; >> alpha = best; >> } >> for (all captures) >> { >> if (value of captured piece + margin < alpha) >> continue; /* Futile to try this move */ > > if (eval () + value of captured piece + margin < alpha) > { > best = eval () + value of captured piece + margin; > continue; > } > >FYI - I caught this at the first pass, but of course the warning (and theme) >didn't hurt :) it seems the fail-soft defender, who doubted about it being more bug-prone, needed a second pass :)
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.