Skip to main content

Consortium for Mathematics and its Applications

Product ID: Articles
Supplementary Print
Undergraduate
High School

Playing with Chromatic Kings (UMAP)

Author: Jennifer J. Quinn, Eric J. Libicki


Determining winning strategies for the game of Chessboard Trichrome is an open problem appearing in Silverman [1991]. Chessboard Trichrome is a two-player game played on an 8 X 8 chessboard with red, black, and white kings. Players alternately place a king of any color on an open square of the board subject to the condition that two kings of the same color cannot be a chess king's move apart; a chess king can move one square horizontally, vertically, or diagonally. The player who places the last king wins. This paper determines winning strategies for many versions of Chromatic Kings.

Table of Contents:

INTRODUCTION

DUPLICATION
Theorem 1
Theorem 2
Theorem 3

THE 1 x n BOARD
Theorem 4

FINAL THOUGHTS

ACKNOWLEDGMENTS

REFERENCES

ABOUT THE AUTHORS

©1999 by COMAP, Inc.
The UMAP Journal 20.2
10 pages

Mathematics Topics:

Discrete Mathematics, Number Theory

Application Areas:

Game theory, strategy

You must have a Full Membership to download this resource.

If you're already a member, login here.

Not yet a member?