Author: Mores Prachaybrued
Date: 16:19:30 05/05/00
Go up one level in this thread
Someone maybe confused by the pseudo code, I copies it wrong.. so i will make corrections here. >(S1) Define Scout(n,alpha,beta) as >(S2) If n is a leaf then return static_eval(n). >(S3) Let C <- the children of n, and >(S4) b <- -Scout(c0,-beta,-alpha). >(S5) ;; the first child's valuation may cause this node to fail high. >(S6) If b >= beta then return b. >(S7) If b > alpha then set alpha <- b. >(S8) For i from 1 below [C] do: ;; the rest of the child >(S9) Let s <- -scout(ci,-alpha-1,-alpha). ;; test >(S10) If s > b then set b <- s. >(S11) If s >= beta then return s. ;; fail high >(S12) If s > alpha then ;; test >failed >(S13) Set s <- -scout(ci,-beta,-alpha). ;; re-search for >value >(S14) If s >= beta then return s. ;; fail high >(S15) If s > alpha then set alpha <- s. >(S16) If s > b then set b <- s. >(S17) enddo >(S18) return b. I am sorry for any inconvenience.
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.