訂閱以下載
THE 99 HOLE

Update: Optimized to 6/2990/16 and 14/2510/26.

Making a loop without jmp instruction can save a lot of power.

Solved in 6/4148/16 (O(n) time) and 14/2836/26 (O(logn) time)

You can get 2 nops in only 1 instruction by using gen p1 0 0 . This can help you save your lines of code.

Oh my god, if I map 1~26 to A~Z, the test case will be seen as a pangram:
1 17,21,9,3,11 2,18,15,23,14 6,15,24 10,21,13,16,19 15,22,5,18 20,8,5 12,1,26,25 4,15,7
A quick brown fox jumps over the lazy dog

Solved it in 8/3994/19. Couldn't find the 6 cost solution yet, indeed need a nop like Brandonjohns96 to get the timing correct

Solved it for 13/155k/34. Ay yi yi!
Spoilers craved.

Awesome puzzle, I got the 6/4k5/17 one in the bag. Judging by the comments I could save a little more power but I am happy with the result :)

8/4.3k/20 for my solution. I really like how you gotta think about how to get the message through.

Good puzzle. My personal solution was 14/4159/25 but after reading these comments, I think I might be overthinking it. Gotta try that 6 cost solution next

Nice puzzle, I got the 6/x/16 solution down to 4212 power. For the power optimized solution I use binary encoding, I got 14/2662/27 I wonder if @ipg uses same encoding or does some other clever optimisation.

Clever puzzle! Always fun to see ones that seem impossible at first.