Блог пользователя MarioYC

Grundy numbers for possibly cyclic games
Автор MarioYC, 12 лет назад, По-английски
I was reading this to try to understand how to calculate grundy numbers for cyclic games. However I don't get why there are some infinite positions where the first player wins.

Also to implement the algorithm, would I need a boolean matrix M[v][x] to know whether a vertex (v) has a son which a grundy number value equal to some number (x) ? or is it possible to use less memory (this would be about O(V^2) for V states considering we can get values up to V - 1) ?
  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

»
12 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится
Grundy function usually takes small values. Initilize vector M[v] with 10 elements and then enlarge it if necessary.
→ Ответить