Cargo-Bot, shortest solutions

@achrenico, beat the last level, vertical sort, and then press next in the win screen after you complete it

Equalizer @ 15: http://www.youtube.com/watch?v=GN5MY_j6ZdI

Less general solution.

While I did this without optimizing qqq’s code, it’s essentially the same solution.
As there’s always at least one box in the next column, the first recursive call + drop can be changed to non-recursive call (=> 16). Also, the first column is empty, allowing first pick to be postponed to the end of loop. Now there are three similar tuples, allowing reuse (=> 15).

The Trick @ 10:
http://www.youtube.com/watch?v=0YMeC9Bm-2Q

Optimized qqq’s implementation.

nicely done @achrenico.

Jayisgames is also keeping a walkthrough here, although still incomplete as he’s still working through the game

My 12 register solution for Equalizer : http://youtu.be/JZCQBO9OG6k

@Teferi whoa!

Let me add three solutions of mine:

Easy-5 in 7 registers (equal to the current best, but lovely ;P):
http://www.youtube.com/watch?v=6hnTCNDoyyY
Parting the Sea in 14 registers (improvement by 3):
http://www.youtube.com/watch?v=tYkuNjhFC5I
The Trick in 8 registers (improvement by 2):
http://www.youtube.com/watch?v=ceEzcQUcVpI

@tojot both very elegant solutions. I feel like we must be able to get rid of one of those prog4 calls in parting the sea though

I share this feeling, but I can’t tell how :slight_smile:

Hi everyone, first time posting. I’ve found a 10-register solution for “Fill The Blanks”:

http://www.youtube.com/watch?v=nmzonWXEbGg

“Count the Blues”, six registers:

http://www.youtube.com/watch?v=SmzVHVsWQpE

@Myndale, impressive that you were able to beat two solutions that had stood the test of time so far. Congrats!

I’ve updated the “leaderboard” at the top with your solutions.

It would be great to see an update in the AppStore that includes the new records.

… and maybe a link to this discussion.

@totoj, I haven’t had much time to spend on cargo-bot. My priority there is to create a level editor and ability to share levels. Would love some help if anyone is interested.

While developing a solution for count in binary (now I see that is along the lines the current 16 register record) I stumbled with a flawed counter that does the job in 15

http://m.youtube.com/watch?v=bnBQP0ESLQY#

My solution to “Come Together 2” in 7 regs (not shorter, but unknown aproach)
http://www.youtube.com/watch?v=YiMJnoqVqw4

Another take on “Lay it Out”.
Same 7 regs, but the action is more funny :slight_smile:
http://www.youtube.com/watch?v=XtghOr7v9_c


Hi All,
 
I’ve written a solver for Cargo-Bot!
It can check all possible programs for a given level and outputs those, which lead to solution.
I’ve already checked most of the levels up to 7-8 register programs and can say for sure, there are no solutions shorter than gathered here.
Levels with more than 8 register solutions require a small server farm to analyse :)
For all levels there might be many variations. For instance:
- Color Sort has 338 possible solutions in 7 registers.
- Changing Places 2 has 8 solutions in 6 registers:
[ > # < #R> 1    ][                ][                ][          ]
[ >N# < #R> 1    ][                ][                ][          ]
[ >R> # < # 1    ][                ][                ][          ]
[ >R>N# < # 1    ][                ][                ][          ]
[R> > # < # 1    ][                ][                ][          ]
[R> >N# < # 1    ][                ][                ][          ]
[ >N2 # 1        ][ # <            ][                ][          ]
[ >N2 # 1        ][N# <            ][                ][          ]
- Mirror 2 has only 2 solutions in 7 registers:
[ 2 1            ][ # >N2 # <      ][                ][          ]
[ 2 1            ][N# >N2 # <      ][                ][          ]
 
Legend:
< - left
> - right
# - put/pick up the box
1 &ndash; call prog 1
2 &ndash; call prog 2
Modifiers:
N &ndash; no box
R &ndash; red box
 
Stay tuned! ;)
 
 
Regards,
Blaker

@blaker, very awesome!

What did you code it in? Would you mind sharing it?