A linear algorithm for the restricted subtraction games

The subtraction game is a well-known problem in the field of game theory, which is often called a one-heap Nim game. There are two players, a heap of tokens, and a strategy matrix, in this game. It is called a restricted subtraction game if some constraints are imposed on the strategy matrix. The subtraction game could be solved by a classical algorithm with a query complexity no less than O ( N 2 ) and computed by an O ( N 3 2 l o g N ) quantum query algorithm with an error probability ϵ ≤ 1 N . The restricted subtraction game proposed by Huang et al. can be computed by an exact quantum algorithm with O ( N 3 2 ) queries. They also proved that the classical exact query complexity is Θ( N 2 ). In this study, we use an array and an adjacency list to replace the strategy matrix and propose another more general subtraction game than the one introduced by Huang et al. Based on dynamic programming and the replaced game strategy, two linear classical query algorithms are designed to solve the restricted subtraction game proposed by Huang and this study, respectively.