Corpus ID: 6330520

Evolving Winning Strategies for Nim-like Games

  title={Evolving Winning Strategies for Nim-like Games},
  author={Mihai Oltean},
  • M. Oltean
  • Published 21 August 2021
  • Computer Science
  • ArXiv
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. [...] Key Method Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, xor, not) and operands (encoding the current game state). Several numerical experiments for computing the winning strategy for the Nim game are performed. The computational effort needed for evolving a winning strategy is reported. The results show that…Expand
Can ILP Learn Complete and Correct Game Strategies?
This work reports the predictive accuracy curves of learning the positions for winning strategies of a range of combinatorial games and proposes a classifier for P-positions, in which the next player has at least one minimax winning move. Expand
An investigation into the application of genetic programming to combinatorial game theory
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 twoExpand
Multi Expression Programming
Multi Expression Programming (MEP) is a new evolutionary paradigm intended for solving computationally difficult problems. MEP individuals are linear entities that encode complex computer programs.Expand
Multi Expression Programming - an in-depth description
Evaluation of the expressions encoded into an MEP individual can be performed by a single parsing of the chromosome, and offspring obtained by crossover and mutation is always syntactically correct MEP individuals (computer programs). Expand
Genetic Programming with Linear Representation: a Survey
This paper is reviewing the main GP variants with linear representation, namely, Linear Genetic Programming, Gene Expression Programming, Multi Expression programming, Grammatical Evolution, Cartesian Genetic Programming and Stack-Based Genetic Programming. Expand
A hybrid approach based on MEP and CSP for contour registration
A new feature-based algorithm for contour registration automatically based on a hybrid approach combining Multi Expression Programming (MEP) with Clonal Selection Principle (CSP) is developed. Expand


On numbers and games
  • R. Guy
  • Computer Science
  • Proceedings of the IEEE
  • 1978
The motivation for ONAG may have been, and perhaps was-and I would like to think that it was-the attempt to bridge the theory gap between nim-like and chess-like games. Expand
Winning Ways for Your Mathematical Plays
In the quarter of a century since three mathematicians and game theorists collaborated to create Winning Ways for Your Mathematical Plays, the book has become the definitive work on the subject ofExpand
On Numbers and Games
ONAG, as the book is commonly known, is one of those rare publications that sprang to life in a moment of creative energy and has remained influential for over a quarter of a century. OriginallyExpand
Evolving Evolutionary Algorithms Using Multi Expression Programming
An nongenerational EA for function optimization is evolved in this paper and numerical experiments show the effectiveness of this approach. Expand
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess
Aim: To present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; theExpand
Genetic Algorithms in Search Optimization and Machine Learning
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields. Expand
Genetic programming - on the programming of computers by means of natural selection
  • J. Koza
  • Computer Science
  • Complex adaptive systems
  • 1993
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming. Expand
Solving Even-Parity Problems using Multi Expression Programming
Numerical experiments show that MEP outperforms Genetic Programming (GP) with more than one order of magnitude for the considered test cases. Expand
Genetic Algorithms in Search
Uniform Crossover in Genetic Algorithms