A study of the strategies of the combinatorial game

Qi Wu

doi:10.54254/2755-2721/17/20230913

Research Article

Open access

Published on 23 October 2023

Download pdf

Wu,Q. (2023). A study of the strategies of the combinatorial game. Applied and Computational Engineering,17,53-59.

Export citation

A study of the strategies of the combinatorial game

Qi Wu *^,1,

¹ Xi'an University of Architecture and Technology

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2755-2721/17/20230913

Abstract

The combinatorial game theory is not only a new branch of modern mathematics but also an important subject of operations research. One basic combinatorial game can develop many different rules and different strategies to solve the problems, and both the rules and strategies follow the fundamental game theory to give the answer for the new version of the combinatorial game, such as the Nim game, one of the most basic combinatorial games, which has been researched for many years by a large number of researchers. This paper shows and extends the strategies of two combinatorial games, Tic-Tac-Toe and Green Hackenbush, based on the regular version which is connected with the combinatorial game theory.

Keywords

combinatorial games, green hackenbush, game theory, tic-tac-toe

View pdf

References

[1]. Inan, M. S. K., Hasan, R. and Prama, T. T. (2021). An Integrated Expert System with a Supervised Machine Learning based Probabilistic Approach to Play Tic-Tac-Toe. 2021 IEEE 12th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON), New York, NY, USA. 0116-0120. doi: 10.1109/UEMCON53757.2021.9666728.

[2]. Crowley, K. and Siegler, R. S. (1993). Flexible strategy use in young children's tic-tac-toe. Cognitive Science 17(4), 531-561.

[3]. Stewart, F. (2012). Mis`ere Hackenbush is NP-Hard. https://doi.org/10.48550/arXiv.1202.4658.

[4]. CSDN. Move first, and become unbeatable: Strategy study of different Tic-tac-toe (2022). https://blog.csdn.net/weixin_44492824/article/details/127149880.

[5]. Larsson, U., Nowakowski, R. J. and Santos, C. P. (2019). Scoring games: the state of play. Games of no chance 5, 89-111. http://library.msri.org/books/Book70/files/1003.pdf.

[6]. Sampson, J. (2017). Mean Value of Red-Blue-Green Hackenbush Trees. https://www.wittenberg.edu/sites/default/files/media/Thesis.pdf.

[7]. Kostreva, M. M. (2002). Combinatorial Opimization In Nash Games. Computers & Mathematics with Applications 25(10-11), 27-34. https://doi.org/10.1016/0898-1221(93)90278-4.

[8]. Nowakowski, R. J. (2019). Unsolved problems in combinatorial games. Games of no chance 5, 125-168.

[9]. Drori, I. et al. (2020). Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time. 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), Miami, FL, USA, 19-24. doi: 10.1109/ICMLA51294.2020.00013.

Cite this article

Wu,Q. (2023). A study of the strategies of the combinatorial game. Applied and Computational Engineering,17,53-59.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 5th International Conference on Computing and Data Science

Conference website: https://2023.confcds.org/

ISBN：978-1-83558-025-7(Print) / 978-1-83558-026-4(Online)

Conference date: 14 July 2023

Editor：Roman Bauer, Marwan Omar, Alan Wang

Series: Applied and Computational Engineering

Volume number: Vol.17

ISSN：2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).