Comments on: you complete me https://www.increpare.com/2015/12/you-complete-me/ let's try something out here... Sat, 19 May 2018 00:07:20 +0000 hourly 1 https://wordpress.org/?v=4.8.2 By: Pietro https://www.increpare.com/2015/12/you-complete-me/comment-page-1/#comment-125174 Tue, 17 May 2016 00:48:00 +0000 http://www.increpare.com/?p=2549#comment-125174 Consider a vertical corridor, which is 11 squares long. Number the squares from top to bottom 1,2,…,11.

Every time you fill an odd-numbered square, you must also fill an even-numbered square in order to get out of that corridor. (Only even-numbered squares are “connected to the outside”.)

Since there are 6 odd-numbered squares and only 5 even-numbered ones, and it is impossible to “reuse” squares, it follows that it is impossible to finish even ONE vertical corridor without being stuck in it forever.

]]> By: Brian https://www.increpare.com/2015/12/you-complete-me/comment-page-1/#comment-118744 Mon, 28 Dec 2015 18:57:34 +0000 http://www.increpare.com/?p=2549#comment-118744 I’m pretty sure covering all green tiles is impossible, but I’d love to see someone prove it either way.

Some interesting things to note about the source code:
-It has references to a “freshice” entity which is never used
-There is no win condition (although I’m not sure how you’d construct one for this in PuzzleScript)

]]> By: Mike https://www.increpare.com/2015/12/you-complete-me/comment-page-1/#comment-118494 Fri, 25 Dec 2015 02:24:52 +0000 http://www.increpare.com/?p=2549#comment-118494 I’m pretty sure this is difficult. It’s been a long time since my CS classes, so I think i’ve gotta solve it the old fashioned way. Thanks for this im high as hell and laughing atm

]]>