Computational methods in codes and games

This dissertation discusses exhaustive search algorithms and heuristic search methods in combinatorial optimization, including combinatorial games. In this work unidirectional covering codes are introduced and some theoretical foundations for them are laid. Exhaustive search is used to construct asymmetric covering codes, unidirectional covering codes and multiple coverings with given parameters—or to show that no such codes exist. Integer programming formulations, bounds on maximal coverages of partial codes and code isomorphisms are used to prune the search space. Tabu search is used to construct asymmetric and unidirectional covering codes—with several record-breaking codes for the former. A new definition for neighborhood is derived. The traditional board game of go and computer go results are reviewed. The concept of entropy is introduced into the game context as a metric for complexity and for relevance (of features—like distance to the previous move). Experimental results and questionnaire studies are presented to support the use of entropy