Ladislav Végh Profile Ladislav Végh

Analyzing game strategies of the don’t get angry board game using computer simulations

  • Authors Details :  
  • Ladislav Vegh,  
  • Stefan Gubo

Journal title : International Journal of Advanced Natural Sciences and Engineering Researches

Publisher : All Sciences Proceedings

Online ISSN : 2980-0811

314 Views Original Article

In the research described in this paper, we used computer simulations to analyze and compare different types of game strategies in the popular board game Don't Get Angry. Following a brief introduction, we summarized a few previous research papers examining similar board games' game strategies. Next, after a review of the Don't Get Angry game's official rules, we outlined four strategies that can be applied to increase the likelihood of winning. We simulated 50,000 games in which all four players made their moves randomly and 50,000 games where each used a different strategy. We tracked how frequently each player finished first, second, third, or last during the simulations. Furthermore, we recorded how many rounds were needed to complete the game for each player, how many times the players’ pawns were kicked out and returned to their houses by other players, and the number of players’ remaining steps during every gameplay. From the analysis of the recorded data, we could conclude that significant differences exist in the chances of winning the game for the examined strategies when all players use different strategies. The results improve the specific domain knowledge for the Don't Get Angry board game. It may help create more vigorous computer opponents and encourage further study to create a tool for evaluating students' strategic thinking while playing.

Article DOI & Crossmark Data

DOI : https://doi.org/10.59287/as-ijanser.200

Article Subject Details


Article Keywords Details



Article File

Full Text PDF



More Article by Ladislav Végh

Models of data structures in educational visualizations for supporting teaching and learning algorithms and computer programming

Teaching and learning computer programming is challenging for many undergraduate first-year computer science students. during introductory programming courses, novice programmers n...

Using interactive web-based animations to help students to find the optimal algorithms of river crossing puzzles

To acquire algorithmic thinking is a long process that has a few steps. the most basic level of algorithmic thinking is when students recognize the algorithms and various problems ...

Simulations of solving a single-player memory card game with several implementations of a human-like thinking computer algorithm

The memory card game is a game that probably everyone played in childhood. the game consists of n pairs of playing cards, whereas each card of a pair is identical. at the beginning...

Comparing machine learning classification models on a loan approval prediction dataset

In the last decade, we have observed the usage of artificial intelligence algorithms and machine learning models in industry, education, healthcare, entertainment, and several othe...