{"id":2261,"date":"2019-04-10T21:11:07","date_gmt":"2019-04-11T01:11:07","guid":{"rendered":"https:\/\/portfolios.cs.earlham.edu\/?p=2261"},"modified":"2019-05-07T21:16:39","modified_gmt":"2019-05-08T01:16:39","slug":"388-week-12","status":"publish","type":"post","link":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/","title":{"rendered":"388 Week 12"},"content":{"rendered":"\n<p>I have designed a simplified ORE algorithm. I created a chunk library using ascii characters, only 15 different chunks. It is a simplified ORE algorithm because each chunk has 2 anchors, so there is only ever one place for the extension to take place. It also randomly selects the chunks so there is no selection process. While this algorithm is simple, I have been able to generate levels with great diversity. One of the parameters I feed it is the number of chunks I want to stitch together. I find that 40 looks the best and that the more chunks you have the more variety. since there is only ever one extension point, it does not allow for branching which is one facet that make a game more enjoyable. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>I have designed a simplified ORE algorithm. I created a chunk library using ascii characters, only 15 different chunks. It is a simplified ORE algorithm because each chunk has 2 anchors, so there is only ever one place for the &hellip; <a href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/\">Read More<\/a><\/p>\n","protected":false},"author":59,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[19],"tags":[],"class_list":["post-2261","post","type-post","status-publish","format-standard","hentry","category-student"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>388 Week 12 - CS\/DS Student Portfolios<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"388 Week 12 - CS\/DS Student Portfolios\" \/>\n<meta property=\"og:description\" content=\"I have designed a simplified ORE algorithm. I created a chunk library using ascii characters, only 15 different chunks. It is a simplified ORE algorithm because each chunk has 2 anchors, so there is only ever one place for the &hellip; Read More\" \/>\n<meta property=\"og:url\" content=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/\" \/>\n<meta property=\"og:site_name\" content=\"CS\/DS Student Portfolios\" \/>\n<meta property=\"article:published_time\" content=\"2019-04-11T01:11:07+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2019-05-08T01:16:39+00:00\" \/>\n<meta name=\"author\" content=\"Neil Nicholson\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Neil Nicholson\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/\"},\"author\":{\"name\":\"Neil Nicholson\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/e67a281a768e7e4c7639e718c93d0204\"},\"headline\":\"388 Week 12\",\"datePublished\":\"2019-04-11T01:11:07+00:00\",\"dateModified\":\"2019-05-08T01:16:39+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/\"},\"wordCount\":127,\"commentCount\":0,\"articleSection\":[\"Student\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/\",\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/\",\"name\":\"388 Week 12 - CS\\\/DS Student Portfolios\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#website\"},\"datePublished\":\"2019-04-11T01:11:07+00:00\",\"dateModified\":\"2019-05-08T01:16:39+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/e67a281a768e7e4c7639e718c93d0204\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/04\\\/10\\\/388-week-12\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"388 Week 12\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#website\",\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/\",\"name\":\"CS\\\/DS Student Portfolios\",\"description\":\"AI and ML, Image Classification, Arduino\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/e67a281a768e7e4c7639e718c93d0204\",\"name\":\"Neil Nicholson\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g\",\"caption\":\"Neil Nicholson\"},\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/author\\\/nrnicho15\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"388 Week 12 - CS\/DS Student Portfolios","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/","og_locale":"en_US","og_type":"article","og_title":"388 Week 12 - CS\/DS Student Portfolios","og_description":"I have designed a simplified ORE algorithm. I created a chunk library using ascii characters, only 15 different chunks. It is a simplified ORE algorithm because each chunk has 2 anchors, so there is only ever one place for the &hellip; Read More","og_url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/","og_site_name":"CS\/DS Student Portfolios","article_published_time":"2019-04-11T01:11:07+00:00","article_modified_time":"2019-05-08T01:16:39+00:00","author":"Neil Nicholson","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Neil Nicholson","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/#article","isPartOf":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/"},"author":{"name":"Neil Nicholson","@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/e67a281a768e7e4c7639e718c93d0204"},"headline":"388 Week 12","datePublished":"2019-04-11T01:11:07+00:00","dateModified":"2019-05-08T01:16:39+00:00","mainEntityOfPage":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/"},"wordCount":127,"commentCount":0,"articleSection":["Student"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/","url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/","name":"388 Week 12 - CS\/DS Student Portfolios","isPartOf":{"@id":"https:\/\/portfolios.cs.earlham.edu\/#website"},"datePublished":"2019-04-11T01:11:07+00:00","dateModified":"2019-05-08T01:16:39+00:00","author":{"@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/e67a281a768e7e4c7639e718c93d0204"},"breadcrumb":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/04\/10\/388-week-12\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/portfolios.cs.earlham.edu\/"},{"@type":"ListItem","position":2,"name":"388 Week 12"}]},{"@type":"WebSite","@id":"https:\/\/portfolios.cs.earlham.edu\/#website","url":"https:\/\/portfolios.cs.earlham.edu\/","name":"CS\/DS Student Portfolios","description":"AI and ML, Image Classification, Arduino","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/portfolios.cs.earlham.edu\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/e67a281a768e7e4c7639e718c93d0204","name":"Neil Nicholson","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/a2fbd01a7bbcf8ba93cfe709ce26ea84ee78fe583abfd4b53440bee36854d649?s=96&d=mm&r=g","caption":"Neil Nicholson"},"url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/author\/nrnicho15\/"}]}},"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"Neil Nicholson","author_link":"https:\/\/portfolios.cs.earlham.edu\/index.php\/author\/nrnicho15\/"},"rttpg_comment":0,"rttpg_category":"<a href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/category\/student\/\" rel=\"category tag\">Student<\/a>","rttpg_excerpt":"I have designed a simplified ORE algorithm. I created a chunk library using ascii characters, only 15 different chunks. It is a simplified ORE algorithm because each chunk has 2 anchors, so there is only ever one place for the &hellip; Read More","_links":{"self":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2261","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/users\/59"}],"replies":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/comments?post=2261"}],"version-history":[{"count":1,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2261\/revisions"}],"predecessor-version":[{"id":2262,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2261\/revisions\/2262"}],"wp:attachment":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/media?parent=2261"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/categories?post=2261"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/tags?post=2261"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}