{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:23:19Z","timestamp":1743092599565,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_25","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"472-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minesweeper is Difficult Indeed!"],"prefix":"10.1007","author":[{"given":"Alex","family":"Thieme","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2274-7274","authenticated-orcid":false,"given":"Twan","family":"Basten","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2015.02.037","volume":"586","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Demaine, E., Guo, A., Viglietta, G.: Classic Nintendo games are (computationally) hard. Theor. Comput. Sci. 586, 135\u2013160 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.02.037","journal-title":"Theor. Comput. Sci."},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: Proceedings 3rd ACM Symposium on Theory of Computing, STOC, pp. 151\u2013158. ACM (1971). https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Fehnker, A., Vaandrager, F., Zhang, W.: Modeling and verifying a Lego car using hybrid I\/O automata. In: Proceedings 3rd International Conference on Quality Software, QSIC 2003, pp. 280\u2013289. IEEE Computer Society (2003)","DOI":"10.1109\/QSIC.2003.1319112"},{"key":"25_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H., New York (1979)"},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"R Hearn","year":"2009","unstructured":"Hearn, R., Demaine, E.: Games, Puzzles, and Computation. A K Peters\/CRC Press, Boca Raton (2009). https:\/\/doi.org\/10.1201\/b10581"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03025367","volume":"22","author":"R Kaye","year":"2000","unstructured":"Kaye, R.: Minesweeper is NP-complete. Math. Intelligencer 22(2), 9\u201315 (2000). https:\/\/doi.org\/10.1007\/BF03025367","journal-title":"Math. Intelligencer"},{"key":"25_CR7","unstructured":"Kaye, R.: Richard Kaye\u2019s minesweeper pages (2022). https:\/\/web.mat.bham.ac.uk\/R.W.Kaye\/minesw\/minesw.htm"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00283-011-9256-x","volume":"33","author":"A Scott","year":"2011","unstructured":"Scott, A., Stege, U., van Rooij, I.: Minesweeper may not be NP-complete but is hard nonetheless. Math. Intelligencer 33(4), 5\u201317 (2011). https:\/\/doi.org\/10.1007\/s00283-011-9256-x","journal-title":"Math. Intelligencer"},{"key":"25_CR9","unstructured":"Vaandrager, F., Jansen, D., Koopmans, E.: Een module over model checking voor het VWO. In: Proceedings NIOC 2009, pp. 135\u2013137. Hogeschool Utrecht (2009). in Dutch"},{"issue":"13","key":"25_CR10","first-page":"17","volume":"32","author":"F Vaandrager","year":"1998","unstructured":"Vaandrager, F.: Logica is prachtig hulpmiddel bij oplossen informaticaproblemen. Automatisering Gids 32(13), 17 (1998). in Dutch","journal-title":"Automatisering Gids"},{"key":"25_CR11","unstructured":"Vaandrager, F.: A first introduction to Uppaal. Quasimodo Handb. Deliverable D5.12 (2011). ICT-FP7-STREP-214755 project Quasimodo"},{"key":"25_CR12","unstructured":"Vaandrager, F.: Alan Turing: grondlegger van informatica. In: RTL Late Night. RTL (2015). https:\/\/www.rtlxl.nl\/programma\/rtl-late-night\/65b22fda-4ef4-bb8d-0c90-80f670646220. TV program (fragment). in Dutch"},{"key":"25_CR13","first-page":"100","volume":"113","author":"F Vaandrager","year":"2014","unstructured":"Vaandrager, F., Verbeek, F.: Recreational formal methods: designing vacuum cleaning trajectories. Bull. EATCS 113, 100\u2013109 (2014)","journal-title":"Bull. EATCS"},{"key":"25_CR14","unstructured":"Wikipedia: Microsoft Minesweeper (2022). https:\/\/en.wikipedia.org\/wiki\/Microsoft_Minesweeper"},{"key":"25_CR15","unstructured":"Wikipedia: NP-complete games and puzzles (2022). https:\/\/en.wikipedia.org\/wiki\/List_of_NP-complete_problems#Games_and_puzzles"},{"key":"25_CR16","unstructured":"Wikipedia: NP-completeness (2022). https:\/\/en.wikipedia.org\/wiki\/NP-completeness"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:32:34Z","timestamp":1664037154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_25"}},"subtitle":["Technology Scaling for Minesweeper Circuits"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}