w:c:strategywiki>Henke37 (A late level with a cheesy solution) |
w:c:strategywiki>Henke37 (Add copy-pasteable code to the solution) |
||
| Line 12: | Line 12: | ||
There are two main approaches to solving this level. The first one is to generate the curve using recursion. The second one is to hardcode the path and forego elegance completely. | There are two main approaches to solving this level. The first one is to generate the curve using recursion. The second one is to hardcode the path and forego elegance completely. | ||
== Hardcoded Solution == | |||
[[File:Turing Complete FastBot Cheese.png]] | [[File:Turing Complete FastBot Cheese.png]] | ||
It is entirely possible to create a specialized architecture for the level that is little more than a counter, a program and the output pin. Ironically, it takes 63 moves to complete the path, so a one byte per opcode custom arch will pass the achievement limit. | It is entirely possible to create a specialized architecture for the level that is little more than a counter, a program and the output pin. Ironically, it takes 63 moves to complete the path, so a one byte per opcode custom arch will pass the achievement limit. | ||
<nowiki>up | |||
right | |||
down | |||
right | |||
right | |||
up | |||
left | |||
up | |||
right | |||
up | |||
left | |||
left | |||
down | |||
left | |||
up | |||
up | |||
right | |||
up | |||
left | |||
up | |||
up | |||
right | |||
down | |||
right | |||
up | |||
right | |||
down | |||
down | |||
left | |||
down | |||
right | |||
right | |||
right | |||
up | |||
left | |||
up | |||
up | |||
right | |||
down | |||
right | |||
up | |||
right | |||
down | |||
down | |||
left | |||
down | |||
right | |||
down | |||
down | |||
left | |||
up | |||
left | |||
left | |||
down | |||
right | |||
down | |||
left | |||
down | |||
right | |||
right | |||
up | |||
right | |||
down</nowiki> | |||
{{Footer Nav|game=Turing Complete|prevpage=AI Showdown|nextpage=Unseen Fruit}} | {{Footer Nav|game=Turing Complete|prevpage=AI Showdown|nextpage=Unseen Fruit}} | ||
Revision as of 21:39, 7 February 2023
This level asks you to program FastBot, a robot that can move in any cardinal direction without having to turn first, but as a trade off can't see where he's going.
The level is a preset snaking path. It a Hilbert curve.
There are two main approaches to solving this level. The first one is to generate the curve using recursion. The second one is to hardcode the path and forego elegance completely.
Hardcoded Solution
It is entirely possible to create a specialized architecture for the level that is little more than a counter, a program and the output pin. Ironically, it takes 63 moves to complete the path, so a one byte per opcode custom arch will pass the achievement limit.
up right down right right up left up right up left left down left up up right up left up up right down right up right down down left down right right right up left up up right down right up right down down left down right down down left up left left down right down left down right right up right down