第 1 / 1 页
非代码面试题
显示 4 / 4 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
5684Grundy Value at TenConsider the impartial subtraction game where from a single pile a player may remove 1, 3, or 4 stones, and the player taking the last stone wins. Compute the Sprague-Grundy value of a pile of size 10.脑筋急转弯中等数值题未尝试免费5692Kayles Grundy ValueKayles is played on a single row of n adjacent bowling pins. A move knocks down either one pin or two ADJACENT pins, possibly splitting the row into two independent shorter rows. The player who knocks down the last pin wins. Compute the Sprague-Grundy value of a single row of 7 pins.脑筋急转弯中等数值题未尝试免费5693Dawson's Chess Grundy ValueDawson's chess is the octal game .137, whose Grundy values g(n) for n = 0,1,2,... are the well-known sequence 0,0,1,1,2,0,3,1,1,0,3,3,2,2,4,0,5,... (eventually periodic with period 34). In this game a position made of several independent strips is a win for the mover iff the XOR of the strips' Grundy values is nonzero. Using the published sequence, what is g(8)?脑筋急转弯困难数值题未尝试面试订阅5696Grundy Values on a Game DAGA token sits on a vertex of a directed acyclic graph; a move slides it along one outgoing edge, and a player who cannot move (token on a sink) loses. The edges are: S to A, S to B, S to C; A to two distinct sinks; B to A and B to a sink; C to B. Sinks have Grundy value 0. Compute the Grundy values of A, B, C, and S.脑筋急转弯简单数值题未尝试免费