EUVIMEDEUVIMED entdecken
Crossref

Knights Exchange Puzzle—Teaching the Efficiency of Modeling

Mehdi Iranpoor

INFORMS Transactions on Education · 2021-01 · 21 (2) · 108-114

DOI: 10.1287/ited.2019.0235 ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Transactions on Education, 2021-01. Verfasst von Mehdi Iranpoor. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 18 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Puzzles and games enhance the quality of teaching by creating an enjoyable, interactive, and playful atmosphere. The knight exchange is a famous, very old, and amusing game on the chessboard. This puzzle was used by the author to teach modeling in a mathematical programming course designed for graduate students. The aim was to teach the students the efficiency of the models. Accordingly, first, a binary programming formulation was developed. This formulation was, however, found to be inefficient, and tremendous time (i.e., more than four hours) and a large amount of processing memory were needed to solve the puzzle. The puzzle was subsequently formulated as a minimum cost network flow problem. The latter formulation outperformed the general binary formulation by solving the puzzle in less than a minute. The network formulation could also save the required processing memory. The results could help students to learn the value of modeling combinatorial optimization problems as network flows.

Zitieren

APA

Iranpoor, M. (2021). Knights Exchange Puzzle—Teaching the Efficiency of Modeling. INFORMS Transactions on Education, 21(2), 108-114. https://doi.org/10.1287/ited.2019.0235

Vancouver

Iranpoor M. Knights Exchange Puzzle—Teaching the Efficiency of Modeling. INFORMS Transactions on Education. 2021;21(2):108-114. doi:10.1287/ited.2019.0235

BibTeX
@article{Iranpoor2021,
  author = {Iranpoor, Mehdi},
  title = {Knights Exchange Puzzle—Teaching the Efficiency of Modeling},
  journal = {INFORMS Transactions on Education},
  year = {2021},
  volume = {21},
  number = {2},
  pages = {108--114},
  doi = {10.1287/ited.2019.0235}
}
Kostenlos starten →