A heuristic strategy for the game of mastermind

Author

Ma Vida A. Gomez

Date

4-1993

Degree

Bachelor of Science in Agriculture

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Norberto R. Navarrete Jr.

Abstract

The game of Mastermind was represented mathematically. A strategy for the codebreaker in the game is found to be represented by a search tree. Based on ideas observed from Mastermind search trees, a heuristic strategy for the codebreaker in Mastermind was developed. This was compared to two already existing strategies. In terms of search lengths, the new strategy is better than one and a little way behind than the other one. The optimal strategy is still undetermined.

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

Thesis

Recommended Citation

Gomez, Ma Vida A., "A heuristic strategy for the game of mastermind" (1993). Undergraduate Theses. 9848.
https://www.ukdr.uplb.edu.ph/etd-undergrad/9848

Document Type

Thesis