Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Problems on algorithms
Fundamentals of algorithmics
A real-time algorithm for the (n2 − 1)-puzzle
Information Processing Letters
Foundations of algorithms
An efficient algorithm for the knight's tour problem
Discrete Applied Mathematics
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Do we teach the right algorithm design techniques?
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Programming pearls (2nd ed.)
New Turing Omnibus
Computer Algorithms: C++
Concrete Math
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Puzzles and games: addressing different learning styles in teaching operating systems concepts
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Hands-on labs without computers
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Solving the pharaoh's golden staircase problem through dynamic programming
Journal of Computing Sciences in Colleges
Analyze that: puzzles and analysis of algorithms
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Is it really an algorithm: the need for explicit discourse
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Storytelling and puzzles in a software engineering course
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Using puzzles: problem-solving and abstraction
Proceedings of the 8th ACM SIGITE conference on Information technology education
Elaborating heuristic reasoning and rigor with mathematical games
ACM SIGCSE Bulletin
Didactic Games for Teaching Information Theory
ISSEP '10 Proceedings of the 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives: Teaching Fundamentals Concepts of Informatics
Teaching graph algorithms to children of all ages
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
Puzzle games: player strategies across different interaction modalities
Proceedings of the 4th International Conference on Fun and Games
Engaging students by intertwining puzzle-based and problem-based learning
Proceedings of the 13th annual conference on Information technology education
Using XQuery for problem solving
Software—Practice & Experience
An analysis of player strategies and performance in audio puzzles
ICEC'12 Proceedings of the 11th international conference on Entertainment Computing
| Hi-index | 0.00 |
This paper advocates a wider use of puzzles and puzzle-like problems in teaching design and analysis of algorithms. It discusses a variety of puzzles and classifies them according to the general algorithm design techniques. Pedagogic issues are explored.