More Web Proxy on the site http://driver.im/

article

Analyze that: puzzles and analysis of algorithms

Author:

Anany LevitinAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 37, Issue 1

Pages 171 - 175

https://doi.org/10.1145/1047124.1047409

Published: 23 February 2005 Publication History

Abstract

The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples---from classic puzzles of recreational mathematics to newly popular job interview brainteasers---which illustrate all major aspects of algorithm analysis.

References

[1]

Averbach, B. and Chein, O. Mathematics: Problem Solving Through Recreational Mathematics. W.H.Freeman, San Francisco CA, 1980.]]

[2]

Bogomolny, A. Mathematical Miscellany and Puzzles. http://www.cut-the-knot.org.]]

[3]

Brassard, G. and Bratley, P. Fundamental of Algorithmics. Prentice-Hall, Englewood Cliffs NJ, 1996.]]

Digital Library

[4]

Curzon, P. Computing Without Computers, draft of a book, 2001.]]

[5]

Demaine, E. Playing games with algorithms: Algorithmic combinatorial game theory. In Proceedings of MFCS '01 (Marianske Lazne, Czech Republic, August 2001), Lecture Notes in Computer Science, vol. 2136, Springer, 18--32.]]

Digital Library

[6]

Eppstein, D. Computational Complexity of Games and Puzzles. http://www.ics.uci.edu/ eppstein/cgt/hard.html#sok]]

[7]

Gardiner, A. Mathematical Puzzling. Dover, Mineola NY, 1999.]]

[8]

Gardner, M., ed. Mathematical Puzzles of Sam Loyd. Dover, New York NY, 1959.]]

[9]

Gardner, M. aha! Insight. Scientific American/ W.H.Freeman and Co., New York NY, 1978.]]

[10]

Ginat, D. http://www.tau.ac.il/education/homepg/ginat.html]]

[11]

Ginat, D. Efficiency of algorithms for programming beginners. in Proceedings of SIGCSE '96 (Philadelphia PA, February 1996), ACM Press, 256--260.]]

Digital Library

[12]

Hill, J.M.D. et al. Puzzles and games: addressing different learning styles in teaching operating systems concepts. In Proceedings of SIGCSE '03 (Reno NV, February 2003), ACM Press, 182--186.]]

Digital Library

[13]

Huang, T. Strategy game programming projects. JCSC, vol. 16, no. 4, 2001, 205--213.]]

Digital Library

[14]

Kaye, R. W. How complicated is minesweeper? http://web.mat.bham.ac.uk/R.W.Kaye/minesw/ASE2003.pdf]]

[15]

Knott, R. Fibonacci Numbers and the Golden Section. http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci.]]

[16]

Levitin, A. Do we teach the right algorithm design techniques? in Proceedings of SIGCSE '99 (New Orleans LA, March 1999), ACM Press, 179--183.]]

Digital Library

[17]

Levitin, A. Introduction to the Design and Analysis of Algorithms. Addison-Wesley, Boston MA, 2002.]]

Digital Library

[18]

Levitin, A. and Papalaskari, M-A. Using puzzles in teaching algorithms. in Proceedings of SIGCSE '02 (Northern Kentucky, March 2002), ACM Press, 292--296.]]

Digital Library

[19]

Mitchell, W. Another look at CS0. JCSC, vol. 17, no. 1, 2001, 194--205.]]

Digital Library

[20]

Mongan, J. and Suojanen, N. Programming Interviews Exposed, Wiley, New York NY, 2000.]]

Digital Library

[21]

Parberry, I. Problems on Algorithms. Prentice-Hall, Englewood Cliffs NJ, 1995.]]

Digital Library

[22]

Pickover, C.A. The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures Across Dimensions. Princeton University Press, Princeton NJ, 2002.]]

[23]

Poundstone, W. How Would You Move Mount Fuji? Little, Brown and Company, Boston MA, 2003.]]

Digital Library

[24]

Pressman, I., and Singmaster, D. The jealous husbands and the missionaries and cannibals. Math. Gazette, vol. 73, no. 464 (June 1989), 73--81.]]

[25]

Rawlins, G.J.E. Compared to What? An Introduction to the Analysis of Algorithms. Computer Science Press, New York NY, 1991.]]

Digital Library

[26]

Ross, J. M. Guiding students through programming puzzles: value and examples of Java game assignments. SIGCSE Bulletin, vol. 34, no. 4, 2002, 94--98.]]

Digital Library

[27]

Shasha, D. Codes, Puzzles, and Conspiracy. W.H.Freeman, New York NY, 1992.]]

[28]

Skiena, S.S., and Revilla, M.A. Programming Challenges: the Programming Contest Training Manual. Springer, 2003.]]

Digital Library

Cited By

Cicirello V(2013)A CS unplugged activity for the online classroomJournal of Computing Sciences in Colleges10.5555/2460156.246018728:6(162-168)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.5555/2460156.2460187
Cicirello V(2009)Collective bin packingJournal of Computing Sciences in Colleges10.5555/1529995.153002024:6(117-123)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/1529995.1530020
Cicirello V(2022)Interactive Bin Packing: A Java Application for Learning Constructive Heuristics for Combinatorial OptimizationJournal of Open Source Education10.21105/jose.001405:49(140)Online publication date: Mar-2022
https://doi.org/10.21105/jose.00140
Show More Cited By

Index Terms

Analyze that: puzzles and analysis of algorithms
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Analyze that: puzzles and analysis of algorithms
SIGCSE '05: Proceedings of the 36th SIGCSE technical symposium on Computer science education

The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples---from classic puzzles of recreational mathematics to newly popular job interview brainteasers---which ...
Computational design of polyomino puzzles
Abstract
People of all ages enjoy solving geometric puzzles. However, finding suitable puzzles, e.g., puzzles with a moderate level of difficulty or puzzles with intellectually stimulating shapes can be difficult. In addition, designing innovative and ...
The Puzzle Challenge Analysis Tool. A Tool for Analysing the Cognitive Challenge Level of Puzzles in Video Games
CHI PLAY

Video games are often designed around puzzles and problem-solving, leading to challenging yet engaging experiences for players. However, it is hard to measure or compare the challenge level of puzzles in video games. This can make designing appropriately ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin

ACM SIGCSE Bulletin Volume 37, Issue 1

2005

562 pages

ISSN:0097-8418

DOI:10.1145/1047124

Issue’s Table of Contents

SIGCSE '05: Proceedings of the 36th SIGCSE technical symposium on Computer science education
February 2005
610 pages
ISBN:1581139977
DOI:10.1145/1047344
Conference Chairs:
Wanda Dann
Ithaca College
,
Tom Naps
University of Wisconsin - Oshkosh
,
Program Chairs:
Paul Tymann
Rochester Institute of Technology
,
Doug Baldwin
SUNY Geneseo

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 February 2005

Published in SIGCSE Volume 37, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
1,871
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cicirello V(2013)A CS unplugged activity for the online classroomJournal of Computing Sciences in Colleges10.5555/2460156.246018728:6(162-168)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.5555/2460156.2460187
Cicirello V(2009)Collective bin packingJournal of Computing Sciences in Colleges10.5555/1529995.153002024:6(117-123)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/1529995.1530020
Cicirello V(2022)Interactive Bin Packing: A Java Application for Learning Constructive Heuristics for Combinatorial OptimizationJournal of Open Source Education10.21105/jose.001405:49(140)Online publication date: Mar-2022
https://doi.org/10.21105/jose.00140
Butler ZBezáková IFluet KPolycarpou IRead JAndreou PArmoni M(2018)Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education10.1145/3197091.3197109(212-217)Online publication date: 2-Jul-2018
https://dl.acm.org/doi/10.1145/3197091.3197109
Farnell E(2016)Puzzle Pedagogy: A Use of Riddles in Mathematics EducationPRIMUS10.1080/10511970.2016.119546527:2(202-211)Online publication date: Jul-2016
https://doi.org/10.1080/10511970.2016.1195465
Carvalho JDuarte LCarriço LIsbister KMueller FBernhaupt R(2012)Puzzle gamesProceedings of the 4th International Conference on Fun and Games10.1145/2367616.2367624(64-72)Online publication date: 4-Sep-2012
https://dl.acm.org/doi/10.1145/2367616.2367624
Carvalho JDuarte LCarriço L(2012)An analysis of player strategies and performance in audio puzzlesProceedings of the 11th international conference on Entertainment Computing10.1007/978-3-642-33542-6_31(349-362)Online publication date: 26-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33542-6_31
Chun SRyoo JLewandowski GWolfman SCortina TWalker E(2010)Development and application of a web-based programming learning system with LED display kitsProceedings of the 41st ACM technical symposium on Computer science education10.1145/1734263.1734369(310-314)Online publication date: 10-Mar-2010
https://dl.acm.org/doi/10.1145/1734263.1734369
Wirth ABertolacci MDavoli RGoldweber MSalomoni P(2006)New algorithms research for first year studentsProceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education10.1145/1140124.1140160(128-132)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140124.1140160
Wirth ABertolacci M(2006)New algorithms research for first year studentsACM SIGCSE Bulletin10.1145/1140123.114016038:3(128-132)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1140123.1140160

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents