Skip to main content
25 events
when toggle format what by license comment
Aug 5, 2017 at 15:51 comment added Nathan Merrill @edc65 My current opinion is that all questions are open, and so no answer should be accepted :) I upvoted your answer so you at least can redeem some of that rep.
Aug 5, 2017 at 8:30 comment added edc65 Why unaccepting? Did you spot some mistake in my answer?
Aug 1, 2017 at 12:47 history edited Stephen
edited tags
Jul 3, 2015 at 23:09 vote accept Nathan Merrill
Aug 2, 2017 at 5:46
Apr 3, 2015 at 18:21 comment added orlp @edc65 You're wrong, my answer solves all optimally in < 30 seconds.
Apr 3, 2015 at 13:16 answer added orlp timeline score: 5
Mar 30, 2015 at 2:36 history edited Nathan Merrill CC BY-SA 3.0
added 1 character in body
Mar 30, 2015 at 2:35 comment added Nathan Merrill I'm raising the time limit. I simply don't want dumb brute forcing solutions.
Mar 30, 2015 at 0:19 comment added edc65 For puzzle 2 & 3, I dubt an optimal solution can be found in 30 second of less
Mar 29, 2015 at 0:34 answer added edc65 timeline score: 4
Mar 28, 2015 at 23:42 comment added orlp @edc65 Need to optimize more then, question states a limit of 30 seconds.
Mar 28, 2015 at 19:00 comment added edc65 Puzzle 1, 70 steps in 67 seconds. Now golfing
Mar 28, 2015 at 4:19 comment added Nathan Merrill @orlp I'm assuming that multiple entries will provide a reasonable consensus of what the shortest solution actually is.
Mar 28, 2015 at 3:52 comment added orlp @NathanMerrill If you mean Puzzle 1, then I've got a solution in 70 steps. This is a big problem, seeing as we now have no way of making sure an entry is correct.
Mar 28, 2015 at 3:11 comment added Nathan Merrill @orlp, I don't want to post all of them, but the first one should take 87 moves if my program is accurate.
Mar 28, 2015 at 1:28 comment added orlp @NathanMerrill To make sure we're doing things correct, could you add the optimal amount of moves for puzzle 1-4?
Mar 27, 2015 at 23:36 history edited Nathan Merrill CC BY-SA 3.0
added 31 characters in body
Mar 27, 2015 at 23:36 comment added Nathan Merrill @orlp yes, I'll add that to the problem statement.
Mar 27, 2015 at 23:31 comment added orlp Can we assume every input puzzle has a solution?
Mar 27, 2015 at 20:44 history edited Nathan Merrill CC BY-SA 3.0
edited body
Mar 27, 2015 at 20:42 comment added Nathan Merrill @Ditto there is never a case where a block starts on a goal square. The last example simply has two disconnected goal squares.
Mar 27, 2015 at 19:45 comment added Ditto Just a thought - as I read this, I found something a bit confusing. The goals, being "hidden" were hard to see sometimes. In the example you have, they can be "guessed" with resonable accuracy, however, in the event a block is covering the goal entirely, you should have a way to clearly denote the entire goal. What if: Letters for blocks, Upper case when that spot is on a goal? . for space, * for goal ? everything else same ? would that be more clear ?
Mar 27, 2015 at 19:18 history tweeted twitter.com/#!/StackCodeGolf/status/581535717089767424
Mar 27, 2015 at 19:02 history edited Martin Ender
edited tags
Mar 27, 2015 at 19:00 history asked Nathan Merrill CC BY-SA 3.0