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

We present a model generator which generates SAT problems from digraphs. There are a
few restrictions on the input digraphs. There must be no self-loops, and its vertices must be …

Phutball is PSPACE-hard Page 1 Theoretical Computer Science 411 (2010) 3971–3978
Contents lists available at ScienceDirect Theoretical Computer Science journal homepage …

Parallelisation of computationally expensive algorithms, such as Monte-Carlo Tree Search
(MCTS), has become increasingly important in order to increase algorithm performance by …

Go gaming is a struggle for territory control between rival, black and white, stones on a
board. We model the Go dynamics in a game by means of the Ising model whose interaction …

We take a look at the complex domain of sliding-block puzzles, which offers significant
challenges for the field of artificial intelligence. By analysing the properties of this domain, as …

Hyper-heuristics have been successfully applied in solving a variety of computational search
problems. We discuss how a hyper-heuristic can be used to generate adaptive strategies for …

Although AI has excelled at many narrowly defined problems, it is still very far from achieving
human-like performance in terms of solving problems that it was not specifically …

Game theory (GT) is the science of strategic decision making, which is used to study the
competition and cooperation relationships among entities. In multi-player games, GT is a …

In computer Go, moves are typically selected with the aid of a tree search algorithm. Monte-
Carlo tree search (MCTS) is currently the dominant algorithm in computer Go. It has been …