An algorithmic treatment of strategy games

Georg Schrage · International Journal of Mathematical Education in Science and Technology · 1979

A theory of strategy games that emphasizes algorithmic aspects will be developed. A partition algorithm that classifies each possible game position to be either a winning position or a loss position or a draw position is then applied to analyse a special game.

Read the paper · More papers on PaperTik