Problem #WSP - 000003

Problems Set theory and logic Theory of algotithms Game theory

Problem

A technique that can be used to completely solve certain games is drawing game graphs. Given a game G, we draw an arrow pointing from a position g to a position h if there is a move taking the game from position g to position h.

Draw the game graph of Nim(2,2). Is Nim(2,2) a winning position or losing position?