Store Page
Algotica Iterations
All Discussions Screenshots Artwork Broadcasts Videos News Guides Reviews

Algotica Iterations

Store Page
Algotica Iterations > Guides > Sunset's Guides
Not enough ratings
All level optimal solution（全关卡最优解）
By Sunset
You can get most 123 memory saved in the game. If you wanna challenge it. 如果你喜欢这个游戏并深入研究，那么你至少可以获得123个记忆存储单元。
   
Award
Favorite
Favorited
Unfavorite
Created by
Sunset
Offline
Category: Achievements, Gameplay Basics, Maps or Levels, Walkthroughs
Languages: English
Posted
Updated
3 Sep, 2018 @ 4:33am
7 May, 2021 @ 2:32am
256 Unique Visitors
5 Current Favorites
Guide Index
Overview
Introduction（介绍） 
Abbreviations（简写） 
Stage 0 
Stage 1 
Stage 2 
BUG 
Comments
Introduction（介绍）
This guide for how to get most memory saved. And ensure the code is at least. Please leave a message if you have better solutions or suggestion. I will be appreciated.

本指南是关于如何获取最多的 memory saved，并在此条件下尽可能地保证代码总量最少。由于这只是我个人的通关方案，所以可能会有许多没有考虑到的地方，如果你有更好的解决方案，或者任何想法建议，都可以留言，我会在第一时间内回复或测试。

----Most memory saved in normal level（主线关卡最多记忆存储单元）----
Level
0
1
2
3
4
5
6
7
8
9
10
11
Stage 0
0
0
1
1
8
Stage 1
2
4
4
6
1
2
2
11
6
6
2
7
Stage 2
3
0
3
11
2
8
10
0
1
5
----Most memory saved in special level（支线关卡最多记忆存储单元）----
Stage 1 level 2-0: 5 Stage 2 level 6-0: 12

Game Version（游戏版本）: v2.0
If the Algotica Iterations update a new version. Please leave a message. I will update this guide.
如果游戏已更新，请留言通知我，我将会第一时间更新指南。
Abbreviations（简写）
f - forward b - backward l - turn-left r - turn-right j - jump a - activate s - skip (* Find command in Stage 2 level 4 *) f(x) - forward(x) (* Find command in Stage 2 level 0 *) b(x) - backward(x) (* Find command in Stage 2 level 1 *) j(x) - jump(x) (* Find command in Stage 2 level 7 *) F1 - F1 smaller - smaller (* Find command in Stage 2 level 9 *)
Stage 0
Level 0
memory saved: 0
MAIN: f
Level 1
memory saved: 0
MAIN: f b
Level 2
memory saved: 1
MAIN: f l
Level 3
memory saved: 1
MAIN: f r
Level 4
memory saved: 6
MAIN: F1 F1 f l
F1: f r

memory saved: 8
MAIN: r j(8)
premise: find command "j(x)" 前提条件: 需要学会指令 "j(x)"
Stage 1
----Level 0
memory saved: 2
MAIN: f l
----Level 1
memory saved: 4
MAIN: F1 F1 F1 f
F1: f l
----Level 2
memory saved: 3
MAIN: F1 l F1 j j
F1: f memory saved: 4
MAIN: f l j(14)
premise: find command "jump(x)" 前提条件: 需要学会指令 "jump(x)"
----Level 2-0
memory saved: 5
MAIN: F1 F1 F1 s F1
F1: f l s
premise: find command "Smaller" and through the level 2 前提条件: 需要学会指令 "Smaller" 才能从 level 2 进入
----Level 3
memory saved: 5
MAIN: f j F1 F1 b b
F1: l f memory saved: 6
MAIN: f j F1 F1 b(1)
F1: l f
premise: find command "b(x)" 前提条件: 需要学会指令 "b(x)"
----Level 4
memory saved: 1
MAIN: f
----Level 5
memory saved: 2
MAIN: b F1 j F1
F1: f memory saved: 2
MAIN: b f j(12)
premise: find command "j(x)" 前提条件: 需要学会指令 "j(x)"
----Level 6
memory saved: 2
MAIN: F1 l F1 j
F1: f
----Level 7
memory saved: 11
MAIN: F1 F1 F1 F1 F1 F1 f
F1: f l
----Level 8
memory saved: 6
MAIN: F1 b l F1 r
F1: f
----Level 9
memory saved: 6
MAIN: F1 a b F1 F1 F1
F1: f r
----Level 10
memory saved: 0
MAIN: f a b memory saved: 2
MAIN: j(29)
premise: find command "j(x)" 前提条件: 需要学会指令 "j(x)"
----Level 11
memory saved: 7
MAIN: b a f a b F1 j F1 F1 j F1 f F1 F1
F1: r
Stage 2
----Level 0
memory saved: 3
MAIN: F1 b r F1 l
F1: f
----Level 1
memory saved: 0
MAIN: f(2) r f(6)
----Level 2
memory saved: 3
MAIN: F1 F1 f(1)
F1: f(2) r f r
----Level 3
memory saved: 7
MAIN: F1 b r j F1 F1 l F1 r F1 r f(3) l
F1: f memory saved: 11
MAIN: f F1 j(19) F1 j(16) l
F1: r
premise: find command "j(x)" 前提条件: 需要学会指令 "j(x)"
----Level 4
memory saved: 2
MAIN: f(1) F1 b l b F1
F1: a
----Level 5
memory saved: 8
MAIN: F1 l F1 F1 F1
F1: f
----Level 6
memory saved: 7
MAIN: f(2) f a b(2) F1 F1 a b(1) r
F1: l f(1) memory saved: 10
MAIN: F1 F1 a b(2) l F1 j(21) f
F1: f(1)
premise: find command "j(x)" 前提条件: 需要学会指令 "j(x)"
----Level 6-0
memory saved: 7
MAIN: l f F1 l F1
F1: j(17)
----Level 7
memory saved: 0
MAIN: j(20)
----Level 8
memory saved: 1
MAIN: b a j(22)
----Level 9
memory saved: 5
MAIN: j(16) F1 F1 j(20)
F1: j(13) r
BUG
BUG#1

If we don't put all the code to the MAIN area but F1 area. Click the robot Lony and choose clear. You will find the F1 area has not been cleared. But memory saved has been initialization. Put the F1 command to the MAIN area and run the robot. You will get all the memory saved.

如果把所有的代码放入F1中，而不是MAIN，然后选择清除所有指令，F1内的指令并不会被清除，并且memory saved 会被重置为初始值，此时将F1添加到MAIN中，即可获取该关卡全部memory saved。

BUG#2

If you run the command jump(20), your next command jump will equal to command jump(20).

如果你先运行过命令 jump(20) ，那么你的下一次 jump 命令会等同于 jump(20).

6 Comments
< >
[HYBRID BEING] 7 May, 2021 @ 7:06am 
Uh, my bad, got levels 1-0 and 1-1 confused. And about 2-6, must have been one extra memory because of BUG#1.
Sunset  [author] 7 May, 2021 @ 2:28am 
Thank you very much for your suggestion. I checked 1-2-0 repeatedly and it was indeed my mistake. The relevant part of the guide has been corrected.

1-1 Your solution is wrong, please check again
2-6 Your solution also saving 7 memory
[HYBRID BEING] 6 May, 2021 @ 11:39am 
For 1-1 you can just have:
MAIN: F1
if command stops on level goal next one won't execute.

I think you copy-pasted solution from level 1-2 to 1-2-0 (or maybe level was changed?). My solution (but i only save 5, not 6 memory):
MAIN: F1 F1 F1 s F1 F1 F1
F1: f l s

Saving 8 memory on 2-6 (without j(x) command):
MAIN: F1 F1 a b(2) l F1 l F1 a b(1) r F1 f
F1: f(1)
oneness629 29 Jun, 2019 @ 4:59am 
厉害了~不过我的智商为负数~emmm~就不尝试了~
感谢大佬提供游戏指南~

如果没有你~
我会卡在stage0-4~:YeSerious:

有了你的指南~
我放弃了思考~同样放弃了隐藏关~:YeWrySmile:
:YeSmile::YeSmile:
Sunset  [author] 29 Jun, 2019 @ 3:56am 
这个指南的初衷是为了提供不一样的精简指令的思路和方法。

关于你说的2个隐藏关，大致步骤如下，但是具体方法还是希望你能多多尝试，相信以你的聪明应该是可以进去的，加油:bbtraccoon:

1. 关卡2-9学会 smaller 指令
2. 关卡1-2使用 smaller 指令进入隐藏关卡2-0
3. 关卡2-6想办法进入隐藏关卡6-0
oneness629 27 Jun, 2019 @ 10:45pm 
好厉害~大佬~我就是靠着你的攻略通关的~
额~但是那些-0的关卡怎么进入？好像我2_0 6_0都是灰色的~？:YeSerious:
算了~玩不下去~太烧脑了~