论文信息 - Search and evaluation in Hex

Search and evaluation in Hex

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.

Jack van Rijswijck

[1] Vadim V. Anshelevich,et al. The Game of Hex: An Automatic Theorem Proving Approach to Game Programming , 2000, AAAI/IAAI.

[2] Anatole Beck,et al. Excursions into Mathematics , 1969 .

[3] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[4] Claude E. Shannon,et al. Computers and Automata , 1953, Proceedings of the IRE.

[5] Ian Stewart,et al. Hex Marks the Spot. , 2000 .

[6] Cameron Browne,et al. Hex strategy - making the right connections , 2000 .

[7] Stefan Reisch,et al. Hex ist PSPACE-vollständig , 1981, Acta Informatica.

[8] Jing Yang,et al. New Winning and Losing Positions for 7x7 HEx , 2002, Computers and Games.

[9] D. Gale. The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .