Problem #PRU-30454

Problems Set theory and logic Algorithm Theory Game Theory Winning and loosing positions

Problem

A rook is on the a1 square of a chessboard. Consider the game with two players where: in one move a player can move the rook by any number of squares to the left, right or up. The winner is the player who places the rook on the square h8. Who would win, if the right strategy is used?