Abstract
SummaryChess 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have