Further generalizations of Wythoff ’ s game and minimum excludant function

@inproceedings{Gurvich2010FurtherGO,
  title={Further generalizations of Wythoff ’ s game and minimum excludant function},
  author={Vladimir Gurvich},
  year={2010}
}
Given non-negative integer a and b, let us consider the following game WY T (a, b). Two piles contain x and y matches. Two players take turns. By one move, it is allowed to take x′ and y′ matches from these piles such that 0 ≤ x′ ≤ x, 0 ≤ y′ ≤ y, 0 < x′ + y′, and [min(x′, y′) < b or |x′ − y′| < a]. The player who takes the last match is the winner… CONTINUE READING