Georgios N. Yannakakis Julian Togelius Page 1 Artificial Intelligence and Games Georgios N.
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …

A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …

Many problems have a huge state space and no good heuristic to order moves so as to
guide the search toward the best positions. Random games can be used to score positions …

Since the 1930s, mathematicians and computer scientists have been interested in
computation. While mathematicians investigate recursion theory, computer scientists …

We propose a technique to construct physical Zero-Knowledge Proof (ZKP) protocols for
puzzles that require a single loop draw feature. Our approach is based on the observation …

Classical methods such as A* and IDA* are a popular and successful choice for one-player
games. However, they fail without an accurate admissible evaluation function. In this paper …

Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers
such that: given areas contain all the numbers up to the number of cells in the area, no …

A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …

The n-Queens problem is to place n chess queens on an n by n chessboard so that no two
queens are on the same row, column or diagonal. The n-Queens Completion problem is a …

We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs
under all three commonly studied reconfiguration models. We show that under the token …