id: 06495937
dt: j
an: 2015f.00865
au: Wagon, Stan
ti: Graph theory problems from hexagonal and traditional chess.
so: Coll. Math. J. 45, No. 4, 278-287 (2014).
py: 2014
pu: Mathematical Association of America (MAA), Washington, D.C.
la: EN
cc: K35 A25
ut: graph theory; traditional chess; hexagonal chess; integer-linear
programming; triangular grid graphs
ci:
li: doi:10.4169/college.math.j.45.4.278
ab: 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 integer-linear
programming is critical to discovering various patterns.
rv: