introductiontocombinatorialgame-資料下載頁(yè)
2025-07-15 19:24本頁(yè)面
【正文】 e moves. (3) At position x, the player whose turn it is to move chooses a position y ∈ F(x). (4) The player who is confronted with a terminal position at his turn, and thus cannot move, loses Minimal Excludant the smallest nonnegative integer not in the set mex{0,1,2,4}=3。 mex{}=0。 The SpragueGrundy Function g(x) = mex{g(y) : y ∈ F(x)} Character If x is a terminal position, g(x) = 0. At postions x for which g(x)=0, every follower y of x is such that g(y)!=0 At postions x for which g(x)!=0,there is at least one follower y such that g(y)=0 The SpragueGrundy Theorem A position, (x1, x2, x3,...,xn), is a Pposition if and only if G(x1)^G(x2)^G(x3)^...^G(xn)=0 Examples poj1704,2425,2311 Reference ? 《 GAME THEORY》 Thomas S. Ferguson ? 《 超高端桌游：一點(diǎn)一線燒糊你的大腦 》 junglerubik ? Wikipedia Thanks!
環(huán)評(píng)公示相關(guān)推薦
鄂ICP備17016276號(hào)-1