Combinatorial Number Puzzles
Combinatorial Number Puzzles is a mathematical problem-solving framework that involves the arrangement, selection, and manipulation of integers under specified constraints to satisfy logically derived numerical and combinatorial conditions.
21
Publications
877
Citations
41
Authors
26
Institutions
Publications per year
2017–2026
2
Parents
21
The Tower of Hanoi--myths and maths
Choice Reviews Online · 2013 · 69 citations
Discrete mathematics: elementary and beyond
Choice Reviews Online · 2003 · 55 citations
A Modern Treatment of the 15 Puzzle
Aaron Archer · American Mathematical Monthly · 1999 · 50 citations
1–5 of 21
41
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 41
26

University of Vaasa
Vaasa, Finland
2 h-index
3 publications
70 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
72 citations
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
69 citations

San Francisco State University
San Francisco, United States
1 h-index
3 publications
45 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
2 publications
376 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
15 citations
Technical University of Munich
Munich, Germany
1 h-index
1 publications
20 citations
Japan Advanced Institute of Science and Technology
Nomi Shi, Japan
1 h-index
1 publications
26 citations
1–8 of 26
CRO · 5 publications · 361 citations
5
h-index
3 publications · 87 citations
3
h-index
1 publications · 15 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 26 citations
1
h-index
1–5