Calculating Ultra-Strong and Extended Solutions for Nine Men's Morris, Morabaraba, and Lasker

07/31/2014
by   Gábor E. Gévay, et al.
0

The strong solutions of Nine Men's Morris and its variant, Lasker Morris are well-known results (the starting positions are draws). We re-examined both of these games, and calculated extended strong solutions for them. By this we mean the game-theoretic values of all possible game states that could be reached from certain starting positions where the number of stones to be placed by the players is different from the standard rules. These were also calculated for a previously unsolved third variant, Morabaraba, with interesting results: most of the starting positions where the players can place an equal number of stones (including the standard starting position) are wins for the first player (as opposed to the above games, where these are usually draws). We also developed a multi-valued retrograde analysis, and used it as a basis for an algorithm for solving these games ultra-strongly. This means that when our program is playing against a fallible opponent, it has a greater chance of achieving a better result than the game-theoretic value, compared to randomly selecting between "just strongly" optimal moves. Previous attempts on ultra-strong solutions used local heuristics or learning during games, but we incorporated our algorithm into the retrograde analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2014

Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games

Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important ro...
research
04/17/2022

On strong avoiding games

Given an increasing graph property F, the strong Avoider-Avoider F game ...
research
08/23/2023

Are ChatGPT and GPT-4 Good Poker Players? – A Pre-Flop Analysis

Since the introduction of ChatGPT and GPT-4, these models have been test...
research
10/19/2020

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard

We prove PSPACE-completeness of two classic types of Chess problems when...
research
02/04/2023

Concave Pro-rata Games

In this paper, we introduce a family of games called concave pro-rata ga...
research
08/03/2020

Sharing Nim and Enumeration of Nim Characteristics

In this paper, we introduce and examine a variant of the game of Nim (Sh...
research
12/05/2021

A Novel Approach to Solving Goal-Achieving Problems for Board Games

Goal-achieving problems are puzzles that set up a specific situation wit...

Please sign up or login with your details

Forgot password? Click here to reset