An optimal MOO strategy

07/08/2022
by   Tetsuro Tanaka, et al.
0

We calculated a fixed strategy that minimizes the average number of guesses (minimum strategy) for the number-guessing game MOO by exhaustive search. Although the minimum strategy for a similar game, mastermind, has been reported, this study seems to be the first to find the minimum strategy for MOO with a larger search space. When two players play against each other in MOO, the minimum strategy is not always the strongest fixed strategy. First, we compute a fixed strategy that has the maximum winning rate when played against the minimum strategy. Then we confirm that there is no fixed strategy with a winning rate exceeding 0.5 against this strategy. This result shows that MOO is a game with the strongest fixed strategy.

READ FULL TEXT
research
03/08/2021

A Classical Search Game in Discrete Locations

Consider a two-person zero-sum search game between a hider and a searche...
research
04/19/2018

Making Change in 2048

The 2048 game involves tiles labeled with powers of two that can be merg...
research
09/15/2017

A generalization of Arc-Kayles

The game Arc-Kayles is played on an undirected graph with two players ta...
research
10/12/2018

Granularity of wagers in games and the (im)possibility of savings

In a casino where arbitrarily small bets are admissible, any betting str...
research
11/06/2018

The entropy of lies: playing twenty questions with a liar

`Twenty questions' is a guessing game played by two players: Bob thinks ...
research
09/08/2019

Minimum status, matching and domination of graphs

The minimum status of a graph is the minimum of statuses of all vertices...
research
08/20/2020

Minimum discrepancy principle strategy for choosing k in k-NN regression

This paper presents a novel data-driven strategy to choose the hyperpara...

Please sign up or login with your details

Forgot password? Click here to reset