Puzzle—A Mathematical Programming Approach for Mongolia’s “The Four Strongest” Puzzle

References

• Barlow E (2024) Integer linear programming: Spreadsheet solver excellence without Excel. INFORMS Trans. Ed. 24(2):196–199.Link, Google Scholar
• Bischoff EE, Wäscher G (1995) Cutting and packing. Eur. J. Oper. Res. 84(3):503–505.Crossref, Google Scholar
• Dantzig GB (2002) Linear programming. Oper. Res. 50(1):42–47.Google Scholar
• Harris M, Forbes M (2023) The snake eggs puzzle: Preparing students for Benders decomposition. INFORMS Trans. Ed. 23(3):210–217.Link, Google Scholar
• Lakhani S, Vora M, Mahajan A (2023) An OR approach for WORdle. INFORMS Trans. Ed. 24(1):103–104.Link, Google Scholar
• McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I—Convex underestimating problems. Math. Program. 10(1):147–175.Crossref, Google Scholar
• Munkhzul A (2020) Collection of the National Museum of Mongolia: “Four Dignities” puzzle. Accessed September 10, 2024, https://montsame.mn/en/read/246048.Google Scholar
• Ninjbat U (2020) “The Four Strongest” at the National Museum of Mongolia. Math. Intelligencer 42(2):9–14.Crossref, Google Scholar
• Schaeffer J, Burch N, Bjornsson Y, Kishimoto A, Muller M, Lake R, Lu P, Sutphen S (2007) Checkers is solved. Science 317(5844):1518–1522.Crossref, Google Scholar
• Vilenkin NY (1971) Combinatorics (Academic Press, New York).Google Scholar