Puzzle 52 Solution - 25 parts


#1

https://www.lodev.org/jstumble/?board=0elree0eleerrrf0l0eerlllee0l0eerrliee0lfelfee


#2

Well spotted, seeing that, since you’re never going to have to count past 3, you can treat B as two separate 2-bit counters, but you could have taken things one step further - since your solution breaks if you ever overflow the top half of B, you’ve got a spare ramp in there:


https://www.lodev.org/jstumble/?board=0elree0eleerrrf0l1flllee0l1eerrliee0lfelfee


#3

Good call, didn’t even notice that ramp wasn’t getting hit while it was running.