
06495937
j
2015f.00865
Wagon, Stan
Graph theory problems from hexagonal and traditional chess.
Coll. Math. J. 45, No. 4, 278287 (2014).
2014
Mathematical Association of America (MAA), Washington, D.C.
EN
K35
A25
graph theory
traditional chess
hexagonal chess
integerlinear programming
triangular grid graphs
doi:10.4169/college.math.j.45.4.278
Summary: Chess pieces of various sorts give rise to intriguing graphs and studying their properties can yield nice conjectures, and sometimes simple proofs. This paper examines some problems related to traditional queens and bishops, and also some pieces arising in a hexagonal version of chess. Using powerful algorithmic methods such as integerlinear programming is critical to discovering various patterns.