Analytical Solution for “EinStein würfelt nicht!” with One Stone

Bonnet, François; Viennot, Simon

doi:10.1007/978-3-319-71649-7_1

Cited by 1 publication

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, we will consider the opponent's pieces as they appear on the path of movement or strategically reduce the player's own number of pieces to increase the chances of movement for other pieces. Additionally, integrating the utilization of opening [13] and endgame databases [29,30] and incorporating calculations based on the Nash equilibrium [26,40] are also worth considering. These ideas may enhance the accuracy of the simulation results and further elevate the program's performance.…”

Section: Discussionmentioning

confidence: 99%

“…Lu et al [22] discussed the optimal placement of pieces on the initial board to increase the chances of winning. Furthermore, Bonnet and Viennot [30] not only analyzed the optimal solutions when both players have only one piece remaining but also calculated the optimal winning probability on a 4 × 4 board size using the Nash equilibrium [26].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Design and Implementation of EinStein Würfelt Nicht Program Monte_Alpha

2023

View full text Add to dashboard Cite

The game of EinStein würfelt nicht involves an element of uncertainty due to die rolling, which poses a big challenge in the development of computer game programs. However, the intriguing nature of probabilistic elements has made this game popular in computer game competitions. This study aimed to develop a high-strength EinStein würfelt nicht program that utilizes an efficient bitboard representation for the game board as well as pre-established probability distribution tables and extensively uses bitwise operations to improve the efficiency of game tree expansion. Additionally, this study attempted to replace random simulation with an evaluation function to enhance the accuracy of the Upper Confidence bounds applied to Trees algorithm. Through this design, we improved the strength of our program, and we hope that this program will be able to achieve additional excellent results in future computer game tournaments.

show abstract