http://turingcomplete.wiki/w/api.php?action=feedcontributions&feedformat=atom&user=AlonzoTG 2026-04-21T22:08:22Z User contributions MediaWiki 1.40.1 http://turingcomplete.wiki/w/index.php?title=Talk:State_Machines_-or-_How_to_solve_the_maze_with_2_gates&diff=3370 2024-01-07T08:16:23Z

<p>AlonzoTG: programatic implementation.</p> <hr /> <div>This is the overture 1 / &quot;Arm&quot; code I got when implementing the solution as a program. My implementation is 791 gates and has a &quot;unary logic unit&quot; which takes a single operand from register 1 and stores to register 3, ignoring register 2. It should be noted that this solution is 24 instructions which is longer than my implementation of the normal algorithm (19 instructions) and performs much worse because the entire code is run at each step where the normal algorithm only executes a fraction of the code at each step. <br /> <br /> #input and mask<br /> in_to_reg2<br /> 2<br /> reg0_to_reg1<br /> and<br /> #compute bits #1 and #2<br /> reg3_to_reg1<br /> reg2_to_reg0<br /> reg5_to_reg2<br /> or<br /> reg3_to_reg1<br /> shl &lt;&lt;&lt;&lt; uses the ULU <br /> reg3_to_reg4<br /> #compute bit #0<br /> reg5_to_reg1<br /> reg0_to_reg2<br /> nor<br /> 1 <br /> reg0_to_reg1<br /> reg3_to_reg2<br /> and <br /> # save state<br /> reg3_to_reg5<br /> reg4_to_reg2<br /> reg3_to_reg1<br /> or<br /> reg3_to_out<br /> # return to top <br /> 0<br /> jump</div>

AlonzoTG