{"id":4557,"date":"2022-02-02T11:30:42","date_gmt":"2022-02-02T16:30:42","guid":{"rendered":"https:\/\/portfolios.cs.earlham.edu\/?page_id=4557"},"modified":"2025-04-15T13:32:13","modified_gmt":"2025-04-15T17:32:13","slug":"liam-peachey","status":"publish","type":"page","link":"https:\/\/portfolios.cs.earlham.edu\/index.php\/students\/2022-2\/cs488\/liam-peachey\/","title":{"rendered":"Liam Peachey"},"content":{"rendered":"\n<h4 class=\"wp-block-heading\">About Me:<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">Hello, I&#8217;m Liam Peachey, a Computer Science and Japanese Language double major. <\/p>\n\n\n\n<h4 class=\"wp-block-heading\">My Project: Parameterized Maze Generation Algorithm for Specific Difficulty<br>Maze Generation<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">Mazes as a problem domain have wide applications, from art and games to testing decision algorithms. While there has been focus on the topology of mazes, recent work on generating specific levels of difficulty of maze is more scant. Additionally, existing models for analyzing a maze&#8217;s difficulty may not accurately reflect difficulty for both humans and computers, with some mazes classified as more difficult appearing easier to a human solving the maze. This project proposes a three piece method for generating mazes of specific difficulty using a neural network, parameterized maze generation algorithm, and difficulty model.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Architecture Diagram<\/h4>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"561\" height=\"812\" src=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/04\/Software-Architecture-Diagram-V4-Vertical.png\" alt=\"\" class=\"wp-image-4813\" srcset=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/04\/Software-Architecture-Diagram-V4-Vertical.png 561w, https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/04\/Software-Architecture-Diagram-V4-Vertical-207x300.png 207w\" sizes=\"(max-width: 561px) 100vw, 561px\" \/><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Link to GitLab Project <a rel=\"noreferrer noopener\" href=\"https:\/\/code.cs.earlham.edu\/ljpeach18\/SpecificDifficultyMazeGenerator\" target=\"_blank\">[here]<\/a> GitHub <a href=\"https:\/\/github.com\/ljpeach\/SpecificDifficultyMazeGenerator\" data-type=\"URL\" data-id=\"https:\/\/github.com\/ljpeach\/SpecificDifficultyMazeGenerator\">[here]<\/a><\/h4>\n\n\n\n<h4 class=\"wp-block-heading\">Software Demonstration Video<\/h4>\n\n\n\n<figure class=\"wp-block-embed-youtube wp-block-embed is-type-video is-provider-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe title=\"Software Demonstration\" width=\"1200\" height=\"675\" src=\"https:\/\/www.youtube.com\/embed\/gjOuGV2_P5Q?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Paper: <\/h4>\n\n\n\n<div class=\"wp-block-file\"><a href=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Parameterized-Maze-Generation-Algorithm-for-Specific-Difficulty-Maze-Generation.pdf\">Parameterized-Maze-Generation-Algorithm-for-Specific-Difficulty-Maze-Generation<\/a><a href=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Parameterized-Maze-Generation-Algorithm-for-Specific-Difficulty-Maze-Generation.pdf\" class=\"wp-block-file__button\" download>Download<\/a><\/div>\n\n\n\n<h4 class=\"wp-block-heading\">Poster: <\/h4>\n\n\n\n<figure class=\"wp-block-image size-large\"><img decoding=\"async\" width=\"1024\" height=\"877\" src=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-1024x877.png\" alt=\"\" class=\"wp-image-4952\" srcset=\"https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-1024x877.png 1024w, https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-300x257.png 300w, https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-768x658.png 768w, https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-1536x1316.png 1536w, https:\/\/portfolios.cs.earlham.edu\/wp-content\/uploads\/2022\/05\/Final-Poster-1-2048x1755.png 2048w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>About Me: Hello, I&#8217;m Liam Peachey, a Computer Science and Japanese Language double major. My Project: Parameterized Maze Generation Algorithm for Specific DifficultyMaze Generation Mazes as a problem domain have wide applications, from art and games to testing decision algorithms. While there has been focus on the topology of mazes, recent work on generating specific &#8230; <a title=\"Liam Peachey\" class=\"read-more\" href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/students\/2022-2\/cs488\/liam-peachey\/\" aria-label=\"Read more about Liam Peachey\">Read more<\/a><\/p>\n","protected":false},"author":108,"featured_media":0,"parent":4565,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-4557","page","type-page","status-publish"],"_links":{"self":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/pages\/4557","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/comments?post=4557"}],"version-history":[{"count":14,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/pages\/4557\/revisions"}],"predecessor-version":[{"id":9882,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/pages\/4557\/revisions\/9882"}],"up":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/pages\/4565"}],"wp:attachment":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/media?parent=4557"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}