Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach.

Shan-Tai Chen Shun-Shii Lin

Published in: Comput. J. (2004)

Keyphrases

partitioning algorithm
orders of magnitude
dynamic programming
worst case
computationally efficient
exhaustive search
minimum spanning tree
computational complexity
significant improvement
computational cost
directed acyclic graph
random graphs
depth first search
maximum clique