{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:36Z","timestamp":1750220196399,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"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":[[2022,9,5]]},"DOI":"10.1145\/3555858.3563265","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T15:48:39Z","timestamp":1667576919000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Entropy Lost: Nintendo\u2019s Not-So-Random Sequence of 32, 767 Bits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6816-4368","authenticated-orcid":false,"given":"Trang","family":"Ngo","sequence":"first","affiliation":[{"name":"Computer Science, Williams College, United States"}]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[{"name":"Computer Science, Williams College, United States"}]}],"member":"320","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.11.018"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4169\/000298910x515794"},{"key":"e_1_3_2_1_3_1","unstructured":"Matt Alt. 2020. The Designer Of The NES Dishes The Dirt On Nintendo\u2019s Early Days. https:\/\/www.kotaku.com.au\/2020\/07\/the-designer-of-the-nes-dishes-the-dirt-on-nintendos-early-days\/.  Matt Alt. 2020. The Designer Of The NES Dishes The Dirt On Nintendo\u2019s Early Days. https:\/\/www.kotaku.com.au\/2020\/07\/the-designer-of-the-nes-dishes-the-dirt-on-nintendos-early-days\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Internet Archive. 2020. [No-Intro] Nintendo - Nintendo Entertainment System. https:\/\/archive.org\/details\/nointro.nes.  Internet Archive. 2020. [No-Intro] Nintendo - Nintendo Entertainment System. https:\/\/archive.org\/details\/nointro.nes."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30004-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa143-3-4"},{"key":"e_1_3_2_1_7_1","volume-title":"Uppaluri Siva\u00a0Ramachandra Murty","author":"Bondy John\u00a0Adrian","year":"1976","unstructured":"John\u00a0Adrian Bondy , Uppaluri Siva\u00a0Ramachandra Murty , 1976 . Graph theory with applications. Vol.\u00a0290. Macmillan London . John\u00a0Adrian Bondy, Uppaluri Siva\u00a0Ramachandra Murty, 1976. Graph theory with applications. Vol.\u00a0290. Macmillan London."},{"key":"e_1_3_2_1_8_1","unstructured":"Ben Cameron Aysu G\u00fcndo\u011fan and Joe Sawada. 2022. Cut-Down de Bruijn Sequences. arXiv preprint arXiv:2205.02815(2022).  Ben Cameron Aysu G\u00fcndo\u011fan and Joe Sawada. 2022. Cut-Down de Bruijn Sequences. arXiv preprint arXiv:2205.02815(2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"Classifying rotationally-closed languages having greedy universal cycles. The electronic journal of combinatorics26","author":"DiMuro Joseph","year":"2019","unstructured":"Joseph DiMuro . 2019. Classifying rotationally-closed languages having greedy universal cycles. The electronic journal of combinatorics26 ( 2019 ), P1.35. Issue 1. Joseph DiMuro. 2019. Classifying rotationally-closed languages having greedy universal cycles. The electronic journal of combinatorics26 (2019), P1.35. Issue 1."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2018.03.006"},{"volume-title":"LATIN 2016: Theoretical Informatics","author":"Dragon Patrick\u00a0Baxter","key":"e_1_3_2_1_11_1","unstructured":"Patrick\u00a0Baxter Dragon , Oscar\u00a0 I Hernandez , and Aaron Williams . 2016. The grandmama de Bruijn sequence for binary strings . In LATIN 2016: Theoretical Informatics . Springer , 347\u2013361. Patrick\u00a0Baxter Dragon, Oscar\u00a0I Hernandez, and Aaron Williams. 2016. The grandmama de Bruijn sequence for binary strings. In LATIN 2016: Theoretical Informatics. Springer, 347\u2013361."},{"key":"e_1_3_2_1_12_1","volume-title":"Is Every Polynomial with Integer Coefficients Near an Irreducible Polynomial?Elemente der Mathematik 69, 3","author":"Filaseta Michael","year":"2014","unstructured":"Michael Filaseta . 2014. Is Every Polynomial with Integer Coefficients Near an Irreducible Polynomial?Elemente der Mathematik 69, 3 ( 2014 ), 130\u2013143. Michael Filaseta. 2014. Is Every Polynomial with Integer Coefficients Near an Irreducible Polynomial?Elemente der Mathematik 69, 3 (2014), 130\u2013143."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2011-02555-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90002-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112780"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2018.07.010"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2928292"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Petar Gaydarov and Konstantin Delchev. 2015. Combinatorial Computations on an Extension of a Problem by P\u00e1l Tur\u00e1n. Serdica Journal of Computing(2015) 257\u2013268.  Petar Gaydarov and Konstantin Delchev. 2015. Combinatorial Computations on an Extension of a Problem by P\u00e1l Tur\u00e1n. Serdica Journal of Computing(2015) 257\u2013268.","DOI":"10.55630\/sjc.2015.9.257-268"},{"volume-title":"Shift Register Sequences(1 ed.)","author":"Golomb W.","key":"e_1_3_2_1_19_1","unstructured":"Solomon\u00a0 W. Golomb . 1981. Shift Register Sequences(1 ed.) . Aegean Park Press . Solomon\u00a0W. Golomb. 1981. Shift Register Sequences(1 ed.). Aegean Park Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422956.2422957"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.133272"},{"key":"e_1_3_2_1_22_1","unstructured":"Thomas Jentzsch. 2017. Pitfall!x256 (was: Pitfall!x16). https:\/\/atariage.com\/forums\/topic\/267046-pitfallx256-was-pitfallx16.  Thomas Jentzsch. 2017. Pitfall!x256 (was: Pitfall!x16). https:\/\/atariage.com\/forums\/topic\/267046-pitfallx256-was-pitfallx16."},{"volume-title":"The Art of Computer Programming","author":"Knuth E","key":"e_1_3_2_1_23_1","unstructured":"Donald\u00a0 E Knuth . 2005. The Art of Computer Programming , Volume 4 , Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Professional . Donald\u00a0E Knuth. 2005. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Professional."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442377"},{"key":"e_1_3_2_1_25_1","volume-title":"Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings","volume":"2007","author":"Lee Gilbert","year":"2007","unstructured":"Gilbert Lee , Frank Ruskey , and Aaron Williams . 2007 . Hamming distance from irreducible polynomials over . Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07 ) (Jan. 2007). https:\/\/doi.org\/10.46298\/dmtcs.3550 10.46298\/dmtcs.3550 Gilbert Lee, Frank Ruskey, and Aaron Williams. 2007. Hamming distance from irreducible polynomials over . Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) (Jan. 2007). https:\/\/doi.org\/10.46298\/dmtcs.3550"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1934-05988-3"},{"key":"e_1_3_2_1_27_1","volume-title":"Feature: Shining A Light On Ikegami Tsushinki","author":"McFerran Damien","year":"2018","unstructured":"Damien McFerran . 2018 . Feature: Shining A Light On Ikegami Tsushinki , The Company That Developed Donkey Kong . https:\/\/www.nintendolife.com\/news\/2018\/02\/feature_shining_a_light_on_ikegami_tsushinki_the_company_that_developed_donkey_kong. Damien McFerran. 2018. Feature: Shining A Light On Ikegami Tsushinki, The Company That Developed Donkey Kong. https:\/\/www.nintendolife.com\/news\/2018\/02\/feature_shining_a_light_on_ikegami_tsushinki_the_company_that_developed_donkey_kong."},{"key":"e_1_3_2_1_28_1","unstructured":"Mike Mika. 2013. Why I hacked Donkey Kong for my daughter. Wired March 11(2013).  Mike Mika. 2013. Why I hacked Donkey Kong for my daughter. Wired March 11(2013)."},{"volume-title":"Racing the beam: The Atari video computer system","author":"Montfort Nick","key":"e_1_3_2_1_29_1","unstructured":"Nick Montfort and Ian Bogost . 2009. Racing the beam: The Atari video computer system . Mit Press . Nick Montfort and Ian Bogost. 2009. Racing the beam: The Atari video computer system. Mit Press."},{"key":"e_1_3_2_1_30_1","unstructured":"Nick Morgan. 2012. Easy 6502 Simulator. https:\/\/skilldrick.github.io\/easy6502\/simulator.html.  Nick Morgan. 2012. Easy 6502 Simulator. https:\/\/skilldrick.github.io\/easy6502\/simulator.html."},{"key":"e_1_3_2_1_31_1","unstructured":"Trang\u00a0Q. Ngo. 2020. Python implementation of Dr. Mario algorithms. https:\/\/github.com\/trangqngo\/Dr-Mario-virus-generation.  Trang\u00a0Q. Ngo. 2020. Python implementation of Dr. Mario algorithms. https:\/\/github.com\/trangqngo\/Dr-Mario-virus-generation."},{"key":"e_1_3_2_1_32_1","unstructured":"nightmareci. 2012. Dr. Mario virus placement. https:\/\/tetrisconcept.net\/threads\/dr-mario-virus-placement.2037.  nightmareci. 2012. Dr. Mario virus placement. https:\/\/tetrisconcept.net\/threads\/dr-mario-virus-placement.2037."},{"key":"e_1_3_2_1_33_1","unstructured":"nightmareci. 2013. Dr. Mario. https:\/\/tetris.wiki\/Dr._Mario.  nightmareci. 2013. Dr. Mario. https:\/\/tetris.wiki\/Dr._Mario."},{"key":"e_1_3_2_1_34_1","unstructured":"Robert\u00a0Xiao (nneonneo). 2015. bgrep. https:\/\/github.com\/nneonneo\/bgrep.  Robert\u00a0Xiao (nneonneo). 2015. bgrep. https:\/\/github.com\/nneonneo\/bgrep."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90047-G"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/100808782"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Joe Sawada Aaron Williams and Dennis Wong. 2016. Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. The electronic journal of combinatorics(2016) P1\u201324.  Joe Sawada Aaron Williams and Dennis Wong. 2016. Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. The electronic journal of combinatorics(2016) P1\u201324.","DOI":"10.37236\/5517"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.08.002"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.09.008"},{"volume-title":"Procedural content generation in games","author":"Shaker Noor","key":"e_1_3_2_1_40_1","unstructured":"Noor Shaker , Julian Togelius , and Mark\u00a0 J Nelson . 2016. Procedural content generation in games . Springer . Noor Shaker, Julian Togelius, and Mark\u00a0J Nelson. 2016. Procedural content generation in games. Springer."},{"key":"e_1_3_2_1_41_1","volume-title":"Primitive binary polynomials. Mathematics of computation 27, 124","author":"Stahnke Wayne","year":"1973","unstructured":"Wayne Stahnke . 1973. Primitive binary polynomials. Mathematics of computation 27, 124 ( 1973 ), 977\u2013980. Wayne Stahnke. 1973. Primitive binary polynomials. Mathematics of computation 27, 124 (1973), 977\u2013980."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9486-8"},{"key":"e_1_3_2_1_43_1","unstructured":"taotao54321. 2018. NES Dr.Mario hand simulator. https:\/\/gist.github.com\/taotao54321\/4ec019a251fdd8f9759fa8a8b5439559.  taotao54321. 2018. NES Dr.Mario hand simulator. https:\/\/gist.github.com\/taotao54321\/4ec019a251fdd8f9759fa8a8b5439559."},{"key":"e_1_3_2_1_44_1","unstructured":"Sam Trenholme. 2013. Alternate Pitfall maps. https:\/\/www.samiam.org\/blog\/20130617.html.  Sam Trenholme. 2013. Alternate Pitfall maps. https:\/\/www.samiam.org\/blog\/20130617.html."},{"key":"e_1_3_2_1_45_1","volume-title":"The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games. 128\u2013129","author":"Williams Aaron","year":"2019","unstructured":"Aaron Williams . 2019 . Dr. Mario Puzzle Generation: Theory, Practice, & History (Famicom\/NES) . In The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games. 128\u2013129 . Aaron Williams. 2019. Dr. Mario Puzzle Generation: Theory, Practice, & History (Famicom\/NES). In The 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games. 128\u2013129."},{"key":"e_1_3_2_1_46_1","unstructured":"Aaron Williams. 2022. Nintendo\u2019s Not-So-Random Sequence. https:\/\/gitlab.com\/combinatronics\/nintendos-not-so-random-sequence.  Aaron Williams. 2022. Nintendo\u2019s Not-So-Random Sequence. https:\/\/gitlab.com\/combinatronics\/nintendos-not-so-random-sequence."}],"event":{"name":"FDG22: 17th International Conference on the Foundations of Digital Games","acronym":"FDG22","location":"Athens Greece"},"container-title":["Proceedings of the 17th International Conference on the Foundations of Digital Games"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555858.3563265","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555858.3563265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:40Z","timestamp":1750186960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555858.3563265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,5]]},"references-count":46,"alternative-id":["10.1145\/3555858.3563265","10.1145\/3555858"],"URL":"https:\/\/doi.org\/10.1145\/3555858.3563265","relation":{},"subject":[],"published":{"date-parts":[[2022,9,5]]},"assertion":[{"value":"2022-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}