Knights Exchange Puzzle—Teaching the Efficiency of Modeling

References

• Bazaraa MS, Jarvis JJ, Sherali HD (2011) Linear Programming and Network Flows (John Wiley & Sons, New York).Google Scholar
• Benjamin A, Chartrand G, Zhang P (2017) The Fascinating World of Graph Theory (Princeton University Press, Princeton, NJ).Google Scholar
• Bosch RA (1999) Peaceably coexisting armies of queens. Optima 62(1):6–9.Google Scholar
• Chlond MJ (2010) Knight domination of 2-D surfaces: A spreadsheet approach. INFORMS Trans. Ed. 10(2):98–101.Link, Google Scholar
• Chlond MJ, Bosch R (2006) The gunport problem. INFORMS Trans. Ed. 6(2):37–43.Link, Google Scholar
• Chlond MJ, Toase CM (2002) IP modeling of chessboard placements and related puzzles. INFORMS Trans. Ed. 2(2):1–11.Link, Google Scholar
• DePuy GW, Taylor GD (2007) Using board puzzles to teach operations research. INFORMS Trans. Ed. 7(2):160–171.Link, Google Scholar
• Elkies ND, Stanley RP (2003) The mathematical knight. Math. Intelligencer 25(1):22–34.Crossref, Google Scholar
• Fujita S, Nakamigawa T, Sakuma T (2012) Colored pebble motion on graphs. Eur. J. Combin. 33(5):884–892.Crossref, Google Scholar
• Goraly G, Hassin R (2010) Multi-color pebble motion on graphs. Algorithmica 58(3):610–636.Crossref, Google Scholar
• Hartmann S (2019) More logic puzzle apps solved by mathematical programming. INFORMS Trans. Ed. 20(1):49–55.Link, Google Scholar
• Iordan AE (2019) Optimal solution of the Guarini puzzle extension using tripartite graphs. IOP Conf. Ser. Materials Sci. Engrg. 477:Abstract 012046.Crossref, Google Scholar
• Kino F, Uno Y (2012) An integer programming approach to solving Tantrix on fixed boards. Algorithms 5(1):158–175.Crossref, Google Scholar
• Letavec C, Ruggiero J (2002) The n-queens problem. INFORMS Trans. Ed. 2(3):101–103.Link, Google Scholar
• Levitin A, Levitin M (2011) Algorithmic Puzzles (Oxford University Press, New York).Crossref, Google Scholar
• Lin SS, Wei CL (2005) Optimal algorithms for constructing knight’s tours on arbitrary n×m chessboards. Discrete Appl. Math. 146(3):219–232.Crossref, Google Scholar
• Martin RK (2012) Large Scale Linear and Integer Optimization: A Unified Approach (Springer Science & Business Media, New York).Google Scholar
• Pearce RH, Forbes MA (2017) The Fillomino puzzle. INFORMS Trans. Ed.17(2):85–89.Link, Google Scholar
• Petkovic M (2009) Famous Puzzles of Great Mathematicians (American Mathematical Society, Providence, RI).Crossref, Google Scholar