*Anany Levitin*

- Published in print:
- 2015
- Published Online:
- October 2017
- ISBN:
- 9780691164038
- eISBN:
- 9781400881338
- Item type:
- chapter

- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691164038.003.0002
- Subject:
- Mathematics, History of Mathematics

This chapter provides a survey of mathematical puzzles solvable in one move. The types considered are divination puzzles, weighing puzzles, rearrangement puzzles, dissection puzzles, and folding ...
More

This chapter provides a survey of mathematical puzzles solvable in one move. The types considered are divination puzzles, weighing puzzles, rearrangement puzzles, dissection puzzles, and folding puzzles. The chapter does not include one-question logic puzzles (e.g., Knights and Knaves) or puzzles that can be solved in one move only because of the small size of the puzzle's instance (e.g., making seven payments with links of a seven-link gold chain). Equation puzzles composed of matchsticks or decimal digits have also been excluded. In addition, the survey suggests several research projects related to the included puzzles. The chapter then concludes with answers to the puzzles highlighted in the survey.Less

This chapter provides a survey of mathematical puzzles solvable in one move. The types considered are divination puzzles, weighing puzzles, rearrangement puzzles, dissection puzzles, and folding puzzles. The chapter does not include one-question logic puzzles (e.g., Knights and Knaves) or puzzles that can be solved in one move only because of the small size of the puzzle's instance (e.g., making seven payments with links of a seven-link gold chain). Equation puzzles composed of matchsticks or decimal digits have also been excluded. In addition, the survey suggests several research projects related to the included puzzles. The chapter then concludes with answers to the puzzles highlighted in the survey.

*Tanya Khovanova*

- Published in print:
- 2015
- Published Online:
- October 2017
- ISBN:
- 9780691164038
- eISBN:
- 9781400881338
- Item type:
- chapter

- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691164038.003.0007
- Subject:
- Mathematics, History of Mathematics

This chapter presents solutions to generalizations of Konstantin Knop's puzzle for any number of minutes and any number of parallel scales. It first describes the similarity of the original puzzle ...
More

This chapter presents solutions to generalizations of Konstantin Knop's puzzle for any number of minutes and any number of parallel scales. It first describes the similarity of the original puzzle with a multiple-pans problem: a coin-weighing puzzle involving balance scales with not two, but any number of pans. The notion of a coin's potential is defined next. The chapter then provides a solution to the parallel weighing problem in case there is an unlimited supply of real coins. Afterward, the chapter offers a solution to the original puzzle and its generalization for any number of minutes, and generalizes these results to the use of more than two scales in parallel. In addition, the find-and-label variation of this problem for any number of minutes is discussed, before the chapter concludes with a comparison of the find-and-label problem with the just-find problem.Less

This chapter presents solutions to generalizations of Konstantin Knop's puzzle for any number of minutes and any number of parallel scales. It first describes the similarity of the original puzzle with a multiple-pans problem: a coin-weighing puzzle involving balance scales with not two, but any number of pans. The notion of a coin's potential is defined next. The chapter then provides a solution to the parallel weighing problem in case there is an unlimited supply of real coins. Afterward, the chapter offers a solution to the original puzzle and its generalization for any number of minutes, and generalizes these results to the use of more than two scales in parallel. In addition, the find-and-label variation of this problem for any number of minutes is discussed, before the chapter concludes with a comparison of the find-and-label problem with the just-find problem.