An investigation into the application of genetic programming to combinatorial game theory

TL;DR

This paper explores how genetic programming can be applied to analyze combinatorial games, demonstrating its benefits and limitations in computing Grundy values and inspiring new game designs.

Contribution

It introduces a novel approach to applying genetic programming to combinatorial game theory and evaluates its effectiveness and challenges.

Findings

Genetic programming can effectively compute Grundy values in certain games.

There are notable advantages and pitfalls in using genetic programming for game analysis.

The study proposes a new game inspired by genetic structures.

Abstract

Genetic programming is the practice of evolving formulas using crossover and mutation of genes representing functional operations. Motivated by genetic evolution we develop and solve two combinatorial games, and we demonstrate some advantages and pitfalls of using genetic programming to investigate Grundy values. We conclude by investigating a combinatorial game whose ruleset and starting positions are inspired by genetic structures.