Skip to main content

Solving sequential games with Boltzmann-learned tactics

  • Simulated Annealing
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature (PPSN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 496))

Included in the following conference series:

  • 250 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Frey, P.W. “Algorithmic Strategies for Improving the Performance of Game-Playing Programs”, Physica 22D, 355 (1986).

    MathSciNet  Google Scholar 

  3. Hill, T. L. “Introduction to Statistical Thermodynamics” Addison-Wesley — Reading, MA, USA — 1960.

    Google Scholar 

  4. 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 

  5. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. “Optimization by Simulated Annealing”, Science, 220, 671 (1983).

    Google Scholar 

  6. Lee, K. and Mahajan, S. “The Development of A World Class Othello Program”. Artificial Intelligence 43, 21 (1990).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Exman, I. (1991). Solving sequential games with Boltzmann-learned tactics. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029755

Download citation

  • DOI: https://doi.org/10.1007/BFb0029755

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54148-6

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics