Evolving strategy for a probabilistic game of imperfect information using genetic programming

Authors:
Wojciech Jaśkowski;Krzysztof Krawiec;Bartosz Wieloch
Affiliations:
Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland
Venue:
Genetic Programming and Evolvable Machines
Year:
2008

Citing 16
Cited 6

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Co-Evolution in the Successful Learning of Backgammon Strategy

Machine Learning
Blondie24: playing at the edge of AI

Blondie24: playing at the edge of AI
Competitive Environments Evolve Better Solutions for Complex Tasks

Proceedings of the 5th International Conference on Genetic Algorithms
The MaxSolve algorithm for coevolution

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GP-Gammon: Genetically Programming Backgammon Players

Genetic Programming and Evolvable Machines
Coevolution of neural networks using a layered pareto archive

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A Monotonic Archive for Pareto-Coevolution

Evolutionary Computation
Strongly typed genetic programming

Evolutionary Computation
Fitnessless coevolution

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Real-time strategy gaines: a new AI research challenge

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A game-theoretic memory mechanism for coevolution

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Evolution of an efficient search algorithm for the mate-in-N problem in chess

EuroGP'07 Proceedings of the 10th European conference on Genetic programming
GP-Robocode: using genetic programming to evolve robocode players

EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Attaining human–competitive game playing with genetic programming

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Real-time neuroevolution in the NERO video game

IEEE Transactions on Evolutionary Computation

Fitness Diversity Parallel Evolution Algorithms in the Turtle Race Game

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Coevolutionary temporal difference learning for Othello

CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Evolving small-board Go players using coevolutionary temporal difference learning with archives

International Journal of Applied Mathematics and Computer Science
Modeling global temperature changes with genetic programming

Computers & Mathematics with Applications
Improving coevolution by random sampling

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Shaping fitness function for evolutionary learning of game strategies

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide the complete record of methodology that let us evolve BrilliAnt, the winner of the Ant Wars contest. Ant Wars contestants are virtual ants collecting food on a grid board in the presence of a competing ant. BrilliAnt has been evolved through a competitive one-population coevolution using genetic programming and fitnessless selection. In this paper, we detail the evolutionary setup that lead to BrilliAnt's emergence, assess its direct and indirect human-competitiveness, and describe the behavioral patterns observed in its strategy.