{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-3707"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-3707","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Permutation Groups and Puzzle Tile Configurations of Instant Insanity II","abstract":"The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or a 5 x 4 puzzle, respectively. We consider the possibilities when we delete a color to make the game a 3 × 3 puzzle and when we add a color, making the game a 5 × 5 puzzle. Finally, we determine if solution two is a permutation of solution one.","abstract_html":"The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or a 5 x 4 puzzle, respectively. We consider the possibilities when we delete a color to make the game a 3 × 3 puzzle and when we add a color, making the game a 5 × 5 puzzle. Finally, we determine if solution two is a permutation of solution one.","abstract_has_math":false,"creators":["Justus, Amanda N"],"institution":null,"degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-05-01T07:00:00Z","date_published":"2014-05-01T07:00:00Z","updated_at":"2026-11-19T07:54:11Z","subjects":["algebra","group theory","combinatorics","Discrete Mathematics and Combinatorics","Set Theory"],"languages":[],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/2337","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/2337","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/3707/viewcontent/JustusA041614f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-3707","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Justus, Amanda N"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2014-04-04T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-05-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["algebra","group theory","combinatorics","Discrete Mathematics and Combinatorics","Set Theory"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/3707/viewcontent/JustusA041614f.pdf","https://dc.etsu.edu/etd/2337"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or a 5 x 4 puzzle, respectively. We consider the possibilities when we delete a color to make the game a 3 × 3 puzzle and when we add a color, making the game a 5 × 5 puzzle. Finally, we determine if solution two is a permutation of solution one."]},{"key":"dc:title","label":"Title","values":["Permutation Groups and Puzzle Tile Configurations of Instant Insanity II"]}]}],"canonical_facts":{"dc:creator":["Justus, Amanda N"],"dc:date.available":["2014-04-04T07:00:00Z"],"dc:date.issued":["2014-05-01T07:00:00Z"],"dc:description.abstract":["The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or a 5 x 4 puzzle, respectively. We consider the possibilities when we delete a color to make the game a 3 × 3 puzzle and when we add a color, making the game a 5 × 5 puzzle. Finally, we determine if solution two is a permutation of solution one."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/3707/viewcontent/JustusA041614f.pdf","https://dc.etsu.edu/etd/2337"],"dc:rights":["Copyright by the authors."],"dc:subject":["algebra","group theory","combinatorics","Discrete Mathematics and Combinatorics","Set Theory"],"dc:title":["Permutation Groups and Puzzle Tile Configurations of Instant Insanity II"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"]},"updated_at":"2026-11-19T07:54:11Z"}