Solving sequential games with Boltzmann-learned tactics
A new approach is proposed to study strictly sequential problems viz. to substitute time sequences by ensembles of states, to be attained and viewed in parallel. 2-player board games are candidate problems for parallelization. Typical sequences of interest are game tactics to be learned. The latter are observable in the final board — the parallel view — of that sequence. We introduce parallel games, played in steps of m simultaneous moves. Non-deterministic relaxation rules are formulated, with Boltzmann factors, to resolve potential conflicts. An alternative way is simulated annealing to a sequence final board, as boards resemble spin systems. The approach enables a variety of novel game experiments. Sample results for specific tactics are discussed for parallel tic-tac-toe and othello.
Unable to display preview. Download preview PDF.
- Divko, R. and Schulten, K. “Stochastic Spin Models for Pattern Recognition”, in Denker, J.S. (ed.) Neural Networks for Computing — AIP Conf. Proc. 151, p. 129 — New York — 1986.Google Scholar
- Hill, T. L. “Introduction to Statistical Thermodynamics” Addison-Wesley — Reading, MA, USA — 1960.Google Scholar
- Hinton, G.E. and Sejnowski, T.J. “Learning and Relearning in Boltzmann Machines”, in Rumelhart, D.E. and McClelland, J.L. (eds.) Parallel Distributed Processing, vol. 1, p. 282 — MIT — Cambridge, MA, USA — 1986.Google Scholar
- Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. “Optimization by Simulated Annealing”, Science, 220, 671 (1983).Google Scholar