AI Chat AI Image Generator AI Video Text to Speech

Search Algorithms for Mastermind

08/16/2019

∙

by Anthony D. Rhodes, et al.

∙

∙

his paper presents two novel approaches to solving the classic board game mastermind, including a variant of simulated annealing (SA) and a technique we term maximum expected reduction in consistency (MERC). In addition, we compare search results for these algorithms to two baseline search methods: a random, uninformed search and the method of minimizing maximum query partition sets as originally developed by both Donald Knuth and Peter Norvig.

research

∙ 01/30/2023

NPSA: Nonparametric Simulated Annealing for Global Optimization

In this paper we describe NPSA, the first parallel nonparametric global ...

0 Rong Chen, et al. ∙

research

∙ 05/18/2016

A comparison of semi-deterministic and stochastic search techniques

This paper presents an investigation of two search techniques, tabu sear...

0 Andy M. Connor, et al. ∙

research

∙ 07/05/2021

Towards solving the 7-in-a-row game

Our paper explores the game theoretic value of the 7-in-a-row game. We r...

0 Domonkos Czifra, et al. ∙

research

∙ 04/24/2023

Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing

This paper presents a local energy distribution based hyperparameter det...

0 Naoya Onizawa, et al. ∙

research

∙ 01/10/2023

Measuring Board Game Distance

This paper presents a general approach for measuring distances between b...

0 Matthew Stephenson, et al. ∙

research

∙ 08/03/2016

Query Clustering using Segment Specific Context Embeddings

This paper presents a novel query clustering approach to capture the bro...

0 S. K Kolluru, et al. ∙

research

∙ 03/05/2023

Composing Mood Board with User Feedback in Concept Space

We propose the Mood Board Composer (MBC), which supports concept designe...

0 Shin Sano, et al. ∙