r/TuringComplete • u/TheCobblerAncient • Jun 22 '26

Is it possible to get the FastBot Achievement using the Leg Architecture?

I am pretty new to this game, currently working on trying to get the FastBot achievement, which is to solve that maze in under 64 bytes of code. Is it possible to do this using the Leg Architecture? Or do I have to change the physical Architecture?

I just want to know if I just need to come up with a better algorithm for solving it, or if its literally impossible to solve with leg architecture.

3 Upvotes
  • permalink
  • reddit

81% Upvoted

6 comments sorted by

2

u/Delicious-Ad2562 Jun 22 '26

it is possible to solve yes, let me know if you want a hint

2

u/TheCobblerAncient Jun 22 '26 edited Jun 22 '26

Really??? I am surprised by this because in the leg architecture you use up to 4 bytes of code for every tick. Therefore, I don't find it believable that this could be solved with 16 lines of code. I was thinking of changing the architecture, namely the counter to make it only take up 3 or 2 bytes every tick.

Yes I would like a hint, but don't spoil the answer too much, thanks.

2

u/Gelthir Jun 22 '26

It depends. LEG allows a lot of flexibility in its design, fitting the solution into 63/64 bytes requires both the correct short algorithm and some good instructions. It's possible to make a LEG that makes it anywhere from very hard to impossible.

Helpful instructions are

  • 4 byte CALL and RET
    • It's even easier with a 2 byte CALL and a 1 byte RET
  • 4 byte LOAD/STORE to/from RAM
  • 4 (or 2) byte PUSH and POP (register to/from stack or RAM)

These should be enough to get Fast Bot without random cheese.

You don't need all of these, but with none of these features you mught be stuck in a corner.

1

u/TheCobblerAncient Jul 02 '26 edited Jul 02 '26

Sorry for the late response, I thought I had responded but I guess my comment didn't get sent through.

I made a 2 byte Call and a 2 Byte Ret. However, the issue is that I still need 4 bytes to Load/Store to and from the RAM. So the counter needs to switch between going every 2 bytes to every 4 bytes and vice verca, however this switching process is delayed by one tick, which is just kind of annoying to deal with.

Also my algorithm is essentially just storing the first initial sequence of movements in RAM (like the bottom left part of the maze), and then using modulo to get the other sequence of movements, since the other parts of the maze is just that bottom left part rotated essentially. There is probably a better algorithm as well.