Jack van Rijswijck

Learn More
In this article we present an overview on the state of the art in games solved in the domain of twoperson zero-sum games with perfect information. The results are summarized and some predictions for the near future are given. The aim of the article is to determine which game characteristics are predominant when the solution of a game is the main target.(More)
In 1981 Claude Berge asked about combinatorial properties that might be used to solve Hex puzzles. In response, we establish properties of dead, or negligible, cells in Hex and the Shannon game. A cell is dead if the colour of any stone placed there is irrelevant to the theoretical outcome of the game. We show that dead cell recognition is NPcomplete for(More)
The state of the art in Hex playing programs around 2002 is that computers can play perfectly on positions up to board size 6 × 6 and are on par with the best human players on board sizes up to about 9 × 9. This report describes currently used and proposed approaches to game tree search and heuristic evaluation functions.
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move(More)
  • 1