{"id":13002,"date":"2013-08-30T21:27:10","date_gmt":"2013-08-31T02:27:10","guid":{"rendered":"http:\/\/blog.kenperlin.com\/?p=13002"},"modified":"2013-08-30T21:27:10","modified_gmt":"2013-08-31T02:27:10","slug":"go-further","status":"publish","type":"post","link":"http:\/\/blog.kenperlin.com\/?p=13002","title":{"rendered":"Go further"},"content":{"rendered":"<p>Yesterday I made the basic Go board.  Today I tried my hand at making a board that automatically cleans up after a battle.<\/p>\n<p>For those of you who don&#8217;t know, the basic idea of Go is to amass territory by strategically placing stones so that they surround your opponent&#8217;s stones.  When groups of stones are completely surrounded &#8212; cut off from any empty spaces that would let them &#8220;breathe&#8221; &#8212; then those stones die, and are removed from the board.<\/p>\n<p>My programming task today was to figure out when a group of stones has died, and then automatically remove them from the board.<\/p>\n<p>Just for fun, I&#8217;ve turned this into a little puzzle.  When you click on the image below, a page will pop up containing a Go board.  Your task is to click twice:  Your first click should add a black stone that finishes surrounding a group of white stones.  Your second click should add a white stone that finishes surrounding a group of white stones.<\/p>\n<p>If you get it right, then after each click a group of surrounded stones will automatically disappear from the board.<\/p>\n<p><center><br \/>\n<a href=http:\/\/mrl.nyu.edu\/~perlin\/go2\/ target=1><img decoding=\"async\" src=\"http:\/\/blog.kenperlin.com\/wp-content\/uploads\/2013\/08\/go2.jpg\"><\/a><br \/>\n<\/center><\/p>\n<p>Because this is all Javascript, you can see the program using &#8220;View Source&#8221; in your browser.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Yesterday I made the basic Go board. Today I tried my hand at making a board that automatically cleans up after a battle. For those of you who don&#8217;t know, the basic idea of Go is to amass territory by strategically placing stones so that they surround your opponent&#8217;s stones. When groups of stones are &hellip; <a href=\"http:\/\/blog.kenperlin.com\/?p=13002\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Go further&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/13002"}],"collection":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=13002"}],"version-history":[{"count":17,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/13002\/revisions"}],"predecessor-version":[{"id":13020,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=\/wp\/v2\/posts\/13002\/revisions\/13020"}],"wp:attachment":[{"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=13002"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=13002"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/blog.kenperlin.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=13002"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}