{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:17Z","timestamp":1772163917850,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T00:00:00Z","timestamp":1109116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,2,23]]},"DOI":"10.1145\/1047344.1047409","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"171-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Analyze that"],"prefix":"10.1145","author":[{"given":"Anany","family":"Levitin","sequence":"first","affiliation":[{"name":"Villanova University, Villanova, PA"}]}],"member":"320","published-online":{"date-parts":[[2005,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mathematics: Problem Solving Through Recreational Mathematics","author":"Averbach B.","year":"1980","unstructured":"Averbach , B. and Chein , O . Mathematics: Problem Solving Through Recreational Mathematics . W.H.Freeman , San Francisco CA , 1980 .]] Averbach, B. and Chein, O. Mathematics: Problem Solving Through Recreational Mathematics. W.H.Freeman, San Francisco CA, 1980.]]"},{"key":"e_1_3_2_1_2_1","unstructured":"Bogomolny A. Mathematical Miscellany and Puzzles. http:\/\/www.cut-the-knot.org.]]  Bogomolny A. Mathematical Miscellany and Puzzles. http:\/\/www.cut-the-knot.org.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"Fundamental of Algorithmics","author":"Brassard G.","year":"1996","unstructured":"Brassard , G. and Bratley , P . Fundamental of Algorithmics . Prentice-Hall , Englewood Cliffs NJ , 1996 .]] Brassard, G. and Bratley, P. Fundamental of Algorithmics. Prentice-Hall, Englewood Cliffs NJ, 1996.]]"},{"key":"e_1_3_2_1_4_1","volume-title":"Computing Without Computers, draft of a book","author":"Curzon P.","year":"2001","unstructured":"Curzon , P. Computing Without Computers, draft of a book , 2001 .]] Curzon, P. Computing Without Computers, draft of a book, 2001.]]"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of MFCS '01 (Marianske Lazne","author":"Demaine E.","year":"2001","unstructured":"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.]] 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.]]"},{"key":"e_1_3_2_1_6_1","unstructured":"Eppstein D. Computational Complexity of Games and Puzzles. http:\/\/www.ics.uci.edu\/ eppstein\/cgt\/hard.html#sok]]  Eppstein D. Computational Complexity of Games and Puzzles. http:\/\/www.ics.uci.edu\/ eppstein\/cgt\/hard.html#sok]]"},{"key":"e_1_3_2_1_7_1","volume-title":"Mathematical Puzzling","author":"Gardiner A.","year":"1999","unstructured":"Gardiner , A. Mathematical Puzzling . Dover , Mineola NY , 1999 .]] Gardiner, A. Mathematical Puzzling. Dover, Mineola NY, 1999.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"Mathematical Puzzles of Sam Loyd","author":"Gardner M.","year":"1959","unstructured":"Gardner , M. , ed. Mathematical Puzzles of Sam Loyd . Dover , New York NY , 1959 .]] Gardner, M., ed. Mathematical Puzzles of Sam Loyd. Dover, New York NY, 1959.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"aha! Insight. Scientific American\/ W","author":"Gardner M.","year":"1978","unstructured":"Gardner , M. aha! Insight. Scientific American\/ W . H.Freeman and Co. , New York NY , 1978 .]] Gardner, M. aha! Insight. Scientific American\/ W.H.Freeman and Co., New York NY, 1978.]]"},{"key":"e_1_3_2_1_10_1","unstructured":"Ginat D. http:\/\/www.tau.ac.il\/education\/homepg\/ginat.html]]  Ginat D. http:\/\/www.tau.ac.il\/education\/homepg\/ginat.html]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/236452.236551"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/611892.611964"},{"issue":"4","key":"e_1_3_2_1_13_1","first-page":"205","article-title":"Strategy game programming projects","volume":"16","author":"Huang T","year":"2001","unstructured":"Huang , T . Strategy game programming projects . JCSC , vol. 16 , no. 4 , 2001 , 205 -- 213 .]] Huang, T. Strategy game programming projects. JCSC, vol. 16, no. 4, 2001, 205--213.]]","journal-title":"JCSC"},{"key":"e_1_3_2_1_14_1","unstructured":"Kaye R. W. How complicated is minesweeper? http:\/\/web.mat.bham.ac.uk\/R.W.Kaye\/minesw\/ASE2003.pdf]]  Kaye R. W. How complicated is minesweeper? http:\/\/web.mat.bham.ac.uk\/R.W.Kaye\/minesw\/ASE2003.pdf]]"},{"key":"e_1_3_2_1_15_1","unstructured":"Knott R. Fibonacci Numbers and the Golden Section. http:\/\/www.mcs.surrey.ac.uk\/Personal\/R.Knott\/Fibonacci.]]  Knott R. Fibonacci Numbers and the Golden Section. http:\/\/www.mcs.surrey.ac.uk\/Personal\/R.Knott\/Fibonacci.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/299649.299747"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"Levitin A.","year":"2002","unstructured":"Levitin , A. Introduction to the Design and Analysis of Algorithms . Addison-Wesley , Boston MA , 2002 .]] Levitin, A. Introduction to the Design and Analysis of Algorithms. Addison-Wesley, Boston MA, 2002.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/563340.563456"},{"issue":"1","key":"e_1_3_2_1_19_1","first-page":"194","article-title":"Another look at CS0","volume":"17","author":"Mitchell W","year":"2001","unstructured":"Mitchell , W . Another look at CS0 . JCSC , vol. 17 , no. 1 , 2001 , 194 -- 205 .]] Mitchell, W. Another look at CS0. JCSC, vol. 17, no. 1, 2001, 194--205.]]","journal-title":"JCSC"},{"key":"e_1_3_2_1_20_1","volume-title":"Programming Interviews Exposed","author":"Mongan J.","year":"2000","unstructured":"Mongan , J. and Suojanen , N . Programming Interviews Exposed , Wiley , New York NY , 2000 .]] Mongan, J. and Suojanen, N. Programming Interviews Exposed, Wiley, New York NY, 2000.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"Problems on Algorithms","author":"Parberry I.","year":"1995","unstructured":"Parberry , I. Problems on Algorithms . Prentice-Hall , Englewood Cliffs NJ , 1995 .]] Parberry, I. Problems on Algorithms. Prentice-Hall, Englewood Cliffs NJ, 1995.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures Across Dimensions","author":"Pickover C.A.","year":"2002","unstructured":"Pickover , C.A. The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures Across Dimensions . Princeton University Press , Princeton NJ , 2002 .]] Pickover, C.A. The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures Across Dimensions. Princeton University Press, Princeton NJ, 2002.]]"},{"key":"e_1_3_2_1_23_1","volume-title":"How Would You Move Mount Fuji? Little","author":"Poundstone W.","year":"2003","unstructured":"Poundstone , W. How Would You Move Mount Fuji? Little , Brown and Company , Boston MA , 2003 .]] Poundstone, W. How Would You Move Mount Fuji? Little, Brown and Company, Boston MA, 2003.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/3619658"},{"key":"e_1_3_2_1_25_1","volume-title":"Compared to What? An Introduction to the Analysis of Algorithms","author":"Rawlins G.J.E.","year":"1991","unstructured":"Rawlins , G.J.E. Compared to What? An Introduction to the Analysis of Algorithms . Computer Science Press , New York NY , 1991 .]] Rawlins, G.J.E. Compared to What? An Introduction to the Analysis of Algorithms. Computer Science Press, New York NY, 1991.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/820127.820175"},{"key":"e_1_3_2_1_27_1","volume-title":"New York NY","author":"Shasha D.","year":"1992","unstructured":"Shasha , D. Codes , Puzzles, and Conspiracy . W.H. Freeman , New York NY , 1992 .]] Shasha, D. Codes, Puzzles, and Conspiracy. W.H.Freeman, New York NY, 1992.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/778145"}],"event":{"name":"SIGCSE05: Technical Symposium on Computer Science Education","location":"St. Louis Missouri USA","acronym":"SIGCSE05","sponsor":["ACM Association for Computing Machinery","SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 36th SIGCSE technical symposium on Computer science education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1047344.1047409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1047344.1047409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:07:47Z","timestamp":1750248467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1047344.1047409"}},"subtitle":["puzzles and analysis of algorithms"],"short-title":[],"issued":{"date-parts":[[2005,2,23]]},"references-count":28,"alternative-id":["10.1145\/1047344.1047409","10.1145\/1047344"],"URL":"https:\/\/doi.org\/10.1145\/1047344.1047409","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1047124.1047409","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,2,23]]},"assertion":[{"value":"2005-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}