Skip to main content

2016 | OriginalPaper | Buchkapitel

A Hybrid Approach to Parallelization of Monte Carlo Tree Search in General Game Playing

verfasst von : Maciej Świechowski, Jacek Mańdziuk

Erschienen in: Challenging Problems and Solutions in Intelligent Systems

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we investigate the concept of a parallelization of Monte Carlo Tree Search applied to games. Specifically, we consider General Game Playing framework, which has originated at Stanford University in 2005 and has become one of the most important realizations of the multi-game playing idea. We introduce a novel parallelization method, called Limited Hybrid Root-Tree Parallelization, based on a combination of two existing ones (Root and Tree Parallelization) additionally equipped with a mechanism of limiting actions available during the search process. The proposed approach is evaluated and compared to the non-limited hybrid version counterpart and to the Tree Parallelization method. The advantages over Root Parallelization are derived on a theoretical basis. In the experiments, the proposed method is more effective than Tree Parallelization and also than non-limited hybrid version in certain games.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)MATH Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)MATH
2.
Zurück zum Zitat Arneson, B., Hayward, R.B., Henderson, P.: Monte Carlo tree search in hex. IEEE Trans. Comput. Intell. AI Games 2(4), 251–258 (2010)CrossRef Arneson, B., Hayward, R.B., Henderson, P.: Monte Carlo tree search in hex. IEEE Trans. Comput. Intell. AI Games 2(4), 251–258 (2010)CrossRef
3.
Zurück zum Zitat Björnsson, Y., Finnsson, H.: CadiaPlayer: a simulation-based general game player. IEEE Trans. Comput. Intell. AI Games 1(1), 4–15 (2009)CrossRef Björnsson, Y., Finnsson, H.: CadiaPlayer: a simulation-based general game player. IEEE Trans. Comput. Intell. AI Games 1(1), 4–15 (2009)CrossRef
4.
Zurück zum Zitat Bratko, I.: Prolog Programming for Artificial Intelligence. International Computer Science Series. Addison Wesley, Boston (2001)MATH Bratko, I.: Prolog Programming for Artificial Intelligence. International Computer Science Series. Addison Wesley, Boston (2001)MATH
5.
Zurück zum Zitat Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012)CrossRef Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012)CrossRef
6.
Zurück zum Zitat Cazenave, T., Jouandeau, N.: On the parallelization of UCT. Proc. CGW07, 93–101 (2007) Cazenave, T., Jouandeau, N.: On the parallelization of UCT. Proc. CGW07, 93–101 (2007)
7.
Zurück zum Zitat Cazenave, T., Jouandeau, N.: A parallel Monte-Carlo tree search algorithm. In: Computers and Games, pp. 72–80. Springer, Berlin (2008) Cazenave, T., Jouandeau, N.: A parallel Monte-Carlo tree search algorithm. In: Computers and Games, pp. 72–80. Springer, Berlin (2008)
8.
Zurück zum Zitat Chaslot, G., Winands, M.H., Szita, I., van den Herik, H.J.: Cross-entropy for Monte-Carlo tree search. ICGA J. 31(3), 145–156 (2008) Chaslot, G., Winands, M.H., Szita, I., van den Herik, H.J.: Cross-entropy for Monte-Carlo tree search. ICGA J. 31(3), 145–156 (2008)
9.
Zurück zum Zitat Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: Computers and Games, pp. 72–83. Springer, Berlin (2007) Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: Computers and Games, pp. 72–83. Springer, Berlin (2007)
10.
Zurück zum Zitat Enzenberger, M., Müller, M.: A lock-free multithreaded Monte-Carlo tree search algorithm. In: Advances in Computer Games, pp. 14–20. Springer, Berlin (2010) Enzenberger, M., Müller, M.: A lock-free multithreaded Monte-Carlo tree search algorithm. In: Advances in Computer Games, pp. 14–20. Springer, Berlin (2010)
11.
Zurück zum Zitat Gelly, S., Silver, D.: Achieving Master Level Play in 9 x 9 Computer Go. In: AAAI, vol. 8, pp. 1537–1540 (2008) Gelly, S., Silver, D.: Achieving Master Level Play in 9 x 9 Computer Go. In: AAAI, vol. 8, pp. 1537–1540 (2008)
12.
Zurück zum Zitat Gelly, S., Kocsis, L., Schoenauer, M., Sebag, M., Silver, D., Szepesvári, C., Teytaud, O.: The grand challenge of computer Go: Monte Carlo tree search and extensions. Commun. ACM 55(3), 106–113 (2012)CrossRef Gelly, S., Kocsis, L., Schoenauer, M., Sebag, M., Silver, D., Szepesvári, C., Teytaud, O.: The grand challenge of computer Go: Monte Carlo tree search and extensions. Commun. ACM 55(3), 106–113 (2012)CrossRef
13.
Zurück zum Zitat Genesereth, M.R., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62–72 (2005) Genesereth, M.R., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62–72 (2005)
14.
Zurück zum Zitat Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Proceedings of the 17th European Conference on Machine Learning. ECML’06, pp. 282–293. Springer, Berlin (2006) Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Proceedings of the 17th European Conference on Machine Learning. ECML’06, pp. 282–293. Springer, Berlin (2006)
16.
Zurück zum Zitat Mańdziuk, J., Świechowski, M.: Generic heuristic approach to general game playing. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM. Lecture Notes in Computer Science, vol. 7147, pp. 649–660. Springer, Berlin (2012) Mańdziuk, J., Świechowski, M.: Generic heuristic approach to general game playing. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM. Lecture Notes in Computer Science, vol. 7147, pp. 649–660. Springer, Berlin (2012)
17.
Zurück zum Zitat Méhat, J., Cazenave, T.: A parallel general game player. Künstliche Intell. 25(1), 43–47 (2011)CrossRef Méhat, J., Cazenave, T.: A parallel general game player. Künstliche Intell. 25(1), 43–47 (2011)CrossRef
18.
Zurück zum Zitat Méhat, J., Cazenave, T.: Tree parallelization of ary on a cluster. In: Proceedings of the IJCAI-11 Workshop on General Game Playing (GIGA’11), pp. 39–43 (2011) Méhat, J., Cazenave, T.: Tree parallelization of ary on a cluster. In: Proceedings of the IJCAI-11 Workshop on General Game Playing (GIGA’11), pp. 39–43 (2011)
19.
Zurück zum Zitat Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87(1–2), 255–293 (1996)MathSciNetCrossRef Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87(1–2), 255–293 (1996)MathSciNetCrossRef
20.
Zurück zum Zitat Świechowski, M.: Adaptive simulation-based meta-heuristic methods in synchronous multiplayer games. Ph.D. thesis, Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland (2015) in review Świechowski, M.: Adaptive simulation-based meta-heuristic methods in synchronous multiplayer games. Ph.D. thesis, Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland (2015) in review
22.
Zurück zum Zitat Świechowski, M., Mańdziuk, J.: Self-adaptation of playing strategies in general game playing. IEEE Trans. Comput. Intell. AI Games 6(4), 367–381 (2014)CrossRef Świechowski, M., Mańdziuk, J.: Self-adaptation of playing strategies in general game playing. IEEE Trans. Comput. Intell. AI Games 6(4), 367–381 (2014)CrossRef
23.
Zurück zum Zitat Świechowski, M., Mańdziuk, J.: Specialized vs. multi-game approaches to AI in games. In: Angelov, P., Atanassov, K., Doukovska, L., Hadjiski, M., Jotsov, V., Kacprzyk, J., Kasabov, N., Sotirov, S., Szmidt, E., Zadrożny, S. (eds.) Intelligent Systems’2014. Advances in Intelligent Systems and Computing, vol. 322, pp. 243–254. Springer International Publishing (2015) Świechowski, M., Mańdziuk, J.: Specialized vs. multi-game approaches to AI in games. In: Angelov, P., Atanassov, K., Doukovska, L., Hadjiski, M., Jotsov, V., Kacprzyk, J., Kasabov, N., Sotirov, S., Szmidt, E., Zadrożny, S. (eds.) Intelligent Systems’2014. Advances in Intelligent Systems and Computing, vol. 322, pp. 243–254. Springer International Publishing (2015)
24.
Zurück zum Zitat Świechowski, M., Mańdziuk, J., Ong, Y.S.: Specialization of a UCT-based general game playing program to single-player games. IEEE Trans. Comput. Intell. AI Games (2015) (accepted for publication) Świechowski, M., Mańdziuk, J., Ong, Y.S.: Specialization of a UCT-based general game playing program to single-player games. IEEE Trans. Comput. Intell. AI Games (2015) (accepted for publication)
26.
Zurück zum Zitat Syed, O., Syed, A.: Arimaa - a new game designed to be difficult for computers. ICGA 26, 138–139 (2003) Syed, O., Syed, A.: Arimaa - a new game designed to be difficult for computers. ICGA 26, 138–139 (2003)
27.
Zurück zum Zitat Teytaud, F., Teytaud, O.: Creating an upper-confidence-tree program for Havannah. In: Advances in Computer Games, pp. 65–74. Springer, Berlin (2010) Teytaud, F., Teytaud, O.: Creating an upper-confidence-tree program for Havannah. In: Advances in Computer Games, pp. 65–74. Springer, Berlin (2010)
Metadaten
Titel
A Hybrid Approach to Parallelization of Monte Carlo Tree Search in General Game Playing
verfasst von
Maciej Świechowski
Jacek Mańdziuk
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-30165-5_10