Published on Wed May 15 2019

ELIMINATION from Design to Analysis

Ahmed Khalifa, Dan Gopstein, Julian Togelius

Elimination is a word puzzle game for browsers and mobile devices. All levels are generated by a constrained evolutionary algorithm with no human intervention.

0
0
0
Abstract

Elimination is a word puzzle game for browsers and mobile devices, where all levels are generated by a constrained evolutionary algorithm with no human intervention. This paper describes the design of the game and its level generation methods, and analysis of playtraces from almost a thousand users who played the game since its release. The analysis corroborates that the level generator creates a sawtooth-shaped difficulty curve, as intended. The analysis also offers insights into player behavior in this game.

Mon May 24 2010
Neural Networks
Genetic algorithms and the art of Zen
In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as the Zen Puzzle Garden. We compare the performance of the GA with that of the A* algorithm. Our results show that the GA is competitive with informed search in terms of solution
0
0
0
Tue Sep 10 2019
Artificial Intelligence
Automatic difficulty management and testing in games using a framework based on behavior trees and genetic algorithms
The diversity of agent behaviors is an important topic for the quality of video games and virtual environments. Our paper's main purpose is to create a framework that can automatically create behaviors for game agents of different difficulty classes and enough diversity.
0
0
0
Sat Feb 20 2021
Artificial Intelligence
Game Mechanic Alignment Theory and Discovery
Game Mechanic Alignment theory is a way to organize game mechanics through the lens of environmental rewards and intrinsic player motivations. By disentangling player and environmental influences, game mechanics may be better identified for use in an automated tutorial generation system.
1
0
0
Wed Feb 12 2020
Artificial Intelligence
Recursed is not Recursive: A Jarring Result
0
0
0
Thu Jul 05 2012
Neural Networks
An experimental study of exhaustive solutions for the Mastermind puzzle
Mastermind is a combinatorial problem of high complexity, with applications on fields that range from computer security to genomics. As such a kind of problem, there are no exact solutions. Even exhaustive search methods rely on heuristics to get the best possible hint.
0
0
0
Sat Dec 12 2009
Neural Networks
Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms
The art of solving the Mastermind puzzle was initiated by Donald Knuth and is already more than 30 years old. In this paper we try to suggest a strategy that will allow nature-inspired algorithms to obtain results as good as those based on exhaustive search strategies.
0
0
0