I thought the way this game allows sharing of levels is great, but considering how frequently I want to do this, I found the existing mechanism becomes cumbersome. It would be nice if the game would remember several solutions for each level, allowing me to very easily switch between them for comparison after I initially paste the codes in.

By the way, I noticed a decimal interpretation now shows on levels where it's relevant, for blue/red strings. I thought it would be nice if it interpreted the 2-number input format also, but then I realised that by the time they reach that stage, they will have grasped well enough how to read the numbers themselves.

I think it's great the explanations people have given to help non-engineers to play this game. I really suspect people can learn from it and I'd love to see a message from anyone who with this game feels they made the leap from [struggling for puzzle solutions] to [actually composing "programs" or "machines" to precisely satisfy the specifications, with available space being the main limitation/challenge].

Reply
Milky White Skin Heenim May 24, 2010 1:10 AM

I'm not sure if someone posted this solution for Robocat, but this is definitely the simplest

?lvl=6&code=p12:10f2;p12:9f2;c12:5f3;c12:4f3;c12:6f3;c12:7f3;c12:8f3;

Reply

Just a warning to everyone: In the latest version, the tests are now randomized. So you should probably stop posting solutions that you don't believe work in at least most (and preferably all) cases.

So all those solutions people have been posting that seem to be ridiculously efficient on parts and time by taking advantage of known tests - they won't work anymore. At least not consistently.

I personally think this is an excellent change.

Reply

Found the this hint to solve Android on the first page but I still don't grasp the meaning of the task at hand.

Plain language Android hint:
Go through the whole stack and remove one blue and one red. If there isn't at least one of each, kick it to the floor. Repeat until all gone.

After detecting one blue and one red I keep sending it through a B/R-node until all code is gone ... but this rejects the second robot coming of the line ... what am I misunderstanding?

More in-depth hint:
Is it blue? If blue, go through the stack replacing every other blue with a green until you hit a red. You've now stripped out one of each. Now go through the rest of the stack replacing blues with greens and greens with yellows. Great. Now you've got a green/yellow version of the original, minus one matched pair...

Why not turn all blues yellow immediately? How to differentiate between a blue-turned-green before hitting a red and blue-turned-green after hitting a red?
What's the purpose of adding green and yellow?

None of the codes on this page work for me, so I can't use any of the already posted solutions (besides, I want to figure it out myself but first I must understand what the games requires of me)

Reply

Police Academy!

The input strings in the police level and other levels are even sized. I thought we needed a machine that checks if a string is even sized and returns a yellow dot when it's not. So I made a cute little level for the machine that should stand in front of the Police machine. It's an easy one, more like the early levels.

Code:

?ctm=Police_Academy!;OUTPUT_is_INPUT_for_even_sized_strings_and_1_yellow_dot_to_mark_odd_sized_strings;br:br|bbb:y|bbrbbrrb:bbrbbrrb|brbrbrrbb:y;9;3;0;

Reply
Anonymous May 24, 2010 6:24 AM

Absolutely terrific game!

One remark though: it seems like the selection tool has a problem. Sometimes it erases stuff instead of selecting it? Anyone did experience the same?

Reply
Mystify May 24, 2010 10:45 AM

robochildren

you need to verify that you have an equal number of blue an red.

if you create a machine like so(dots added for spacing):

................|
................V
[rb-branch][rb-branch][rb-branch]
................|
................V

you can test for local equality. If it ends in the center, they are equal, and if it ends in one of the ends, it is inequal. However, sequences of blue or red will through it off the end.

you can mark the end with yellow or green to indicate this, and return them to the device, like so:

........................|
))))))))))))))))))))))))V(((((((((((((((((((((((((
^[green][rb-branch][rb-branch][rb-branch][yellow]^
........................|
........................V


this converts a red-blue string into a yellow-green string. If there were an equal number of blues and reds, it will have an equal number of greens and yellows


you can now duplicate the above pattern for the yellow-green batch, marking with red and blue

)=conveyor

........................|
))))))))))))))))))))))))V(((((((((((((((((((((((((
^[green][rb-branch][rb-branch][rb-branch][yellow]^
^.......................V........................^
^[red] [gy-branch][gy-branch][gy-branch] [blue]..^
........................|
........................V

so it iteratively converts red-blue strings into green-yellow strings, testing for an inequality at each step.
This handles any length string.

Reply
chipmunk May 24, 2010 2:08 PM

It's annoying that the level definitions have changed, which invalidates saved solutions on some levels and best times on most levels. I'd have to start with a fresh game to get accurate best times. :(

Reply

@chipmunk

I commented on this annoyance at the developers page. He responded that he wouldn't do it again.

There are two workarounds, but they might not work if the grid size has changed. You can select and copy/paste cross-level with the in-game tool or edit the level code in a text editor and change the level number.

Or, as I did, build it again and make it even better, learning from brilliant solutions by EyeKey, Buttons and others.

Most of the testing has become faster, especially the complicated levels. So the best-times are usually replaced by the new ones.

Reply

@chipmunk:

It appears that they rolled back to the previous version, as the levels have been returned to their original definitions, and the random testing appears to have been removed.

I liked the random testing. It's too easy to generate simple machines to fake out the predefined tests.

Reply

What does "natural powers of four" mean?

Reply
William McDuff May 24, 2010 7:42 PM

For Robocats:

1. Set switch 1. If red, return to switch. If blue, go on. If empty, trash.

2. Set switch 2. If red, send back before switch 1, if blue, send on. If empty, trash.

3. Set switch 3. If blue, return to switch. If red, return to before switch 1, if empty, send to finish.

This works for all cases.

Reply

@OtherBill:
Are you sure the old version isn't just cached on your pc? Or maybe you're fetching it from a different address? (I am currently getting the new version at the jayisgames address, but it's coming from my cache and I don't know how to de-cache it.)

@keith:
I think it means 4 raised to the power of a "natural number", ie. a counting number like 1,2,3, etc.

Reply

@barryd: Well whaddaya know, you're absolutely right! :-D

Reply

A few of my hopefully more interesting solutions:

Officers (increment):

increment triangle (pretty fast for long inputs):

?lvl=13&code=c6:1f2;c6:2f1;b6:3f1;b6:4f1;b6:5f1;b6:6f1;b6:7f1;b6:8f1;c7:1f2;r7:3f0;r7:4f0;r7:5f0;r7:6f0;r7:7f0;c8:1f3;p8:2f7;i8:3f1;i8:4f6;i8:5f1;i8:6f6;i8:7f1;i8:8f6;c9:2f3;p9:3f7;i9:4f1;i9:5f6;i9:6f1;i9:7f6;i9:8f1;c10:3f3;p10:4f7;i10:5f1;i10:6f6;i10:7f1;i10:8f6;c11:4f3;p11:5f7;i11:6f1;i11:7f6;i11:8f1;c12:5f3;p12:6f7;i12:7f1;i12:8f6;c13:6f3;p13:7f7;i13:8f1;p14:8f7;c11:1f0;b8:11f3;b9:11f3;r9:12f0;b10:11f3;r10:12f0;b11:11f3;r11:12f0;b12:11f3;r12:12f0;b13:11f3;r13:12f0;c14:7f3;i14:9f1;i13:9f6;i12:9f1;i11:9f6;i10:9f1;i9:9f6;i8:9f1;b6:9f1;b14:11f3;r14:12f0;c8:13f2;c9:13f2;c10:13f2;c11:13f2;i14:10f6;i13:10f1;i12:10f6;i11:10f1;i10:10f6;i9:10f1;i8:10f6;r7:8f0;r7:9f0;b6:10f1;c7:10f0;r16:9f3;p16:10f7;b17:10f0;c15:8f3;p15:9f7;i15:10f1;b15:11f3;r15:12f0;g16:11f2;b18:5f1;b18:6f1;b18:7f1;b18:8f1;b18:9f1;c18:11f1;c18:10f1;c11:3f1;q8:12f1;p7:12f3;r6:12f2;q7:13f3;q17:11f5;r7:2f2;c11:2f1;c10:1f0;c9:1f0;g12:2f2;b18:4f1;b18:3f1;b18:2f1;p18:1f4;c12:3f0;c13:3f0;c14:3f0;c15:3f0;c16:3f0;q17:1f0;g17:2f3;c13:2f2;c14:2f2;c15:2f2;c16:2f2;c17:3f0;

based on adder designs from elsewhere (symmetrical, somewhat compact):

?lvl=13&code=c12:6f3;q13:7f5;q11:7f1;p12:7f7;b13:6f0;r11:6f2;r10:4f3;b10:6f1;p10:5f2;q13:5f1;q11:5f5;g12:5f3;p15:5f0;p9:5f2;p14:5f4;r14:4f3;b14:6f1;r15:6f0;b15:4f0;r9:4f2;r9:6f2;c8:5f2;c16:5f0;c16:6f1;c16:7f1;c8:7f1;c8:6f1;g14:7f2;g10:7f0;c9:7f0;c15:7f2;g12:2f3;b12:3f3;c12:8f3;c12:4f3;b11:10f2;q12:9f6;p12:10f3;q12:11f6;r13:10f0;c12:12f3;

Metatron (A+B):

works, but in exponential time (too slow) (rotational symmetry) (same as in my post above):

?lvl=31&code=g14:1f0;r15:4f3;c15:5f3;i15:6f5;c15:7f2;b15:8f2;p16:4f5;c16:5f1;p16:6f2;c16:7f3;p16:8f3;r17:4f0;c17:5f0;i17:6f4;c17:7f1;b17:8f1;c18:6f3;c18:7f3;c18:8f3;c18:9f3;c18:10f3;c18:11f3;c14:6f2;c13:1f3;c13:2f3;c13:3f2;c14:3f3;c14:4f3;c14:5f3;q18:12f0;c18:13f1;p17:12f4;b17:13f1;r17:11f3;q16:12f0;c16:11f3;c16:13f1;c15:12f3;c15:13f0;c14:13f0;c13:13f0;g12:2f2;c15:9f0;r16:9f0;b14:8f3;q14:9f0;c11:13f1;c11:12f1;c11:11f0;c10:11f1;c10:10f1;c10:9f1;c10:8f0;i9:8f1;p8:8f4;p8:10f7;c8:7f1;c8:9f3;c7:9f1;i7:8f0;c9:7f3;c7:7f2;c9:9f0;b9:10f0;b7:10f1;r7:6f2;r9:6f3;p8:6f1;y16:3f2;q17:3f5;g18:3f1;c18:2f0;c17:2f0;c16:2f0;p15:2f0;r15:3f1;b15:1f3;q14:2f4;y8:11f0;q7:11f7;g6:11f3;c6:12f2;c7:12f2;c8:12f2;p9:12f2;r9:11f3;b9:13f1;q10:12f6;g10:13f2;b8:5f2;c9:5f2;q10:5f2;r10:6f1;c11:3f2;c12:3f2;c6:8f1;c6:7f1;c6:6f1;c6:5f2;c7:5f2;c13:11f0;c12:11f0;c10:3f2;g10:4f1;g14:10f3;c14:11f0;

my first working adder (same as in my post above):

?lvl=31&code=c6:6f3;c6:7f3;c6:8f3;r7:6f2;g7:7f1;r7:8f2;c7:9f2;q8:7f1;p8:8f1;c8:9f1;c8:10f1;g9:7f2;r9:8f3;i9:9f1;c9:10f2;c9:11f1;b10:7f1;g10:8f1;b10:9f0;p10:10f2;b10:11f1;q11:8f1;c11:9f1;c11:10f1;r12:7f1;y12:8f1;r12:9f2;p12:10f0;r12:11f1;y13:7f0;b13:8f3;i13:9f5;c13:10f0;c13:11f1;q14:7f1;p14:8f1;c14:9f1;c14:10f0;c14:11f0;b15:6f0;y15:7f1;b15:8f0;c15:9f0;p15:10f0;c15:11f0;p8:11f1;c7:10f1;c7:11f1;c6:9f3;c6:10f3;c6:11f3;c6:12f3;c6:13f2;c7:13f2;c8:13f2;c9:13f2;c10:13f2;c11:13f2;g8:12f1;q9:12f1;c10:12f0;c11:12f0;c12:12f0;c13:12f0;c14:12f0;c15:12f0;c16:12f0;c17:12f0;g16:10f0;q16:9f0;c16:7f3;c16:8f3;c18:12f0;c18:11f3;c18:10f3;c18:9f3;c18:8f3;c18:7f3;p17:2f2;p15:4f3;p14:2f2;c18:2f3;c18:3f3;c18:4f3;c18:5f3;c18:6f3;c16:5f3;c16:6f3;c15:5f2;b16:4f1;b14:4f2;r17:3f0;r17:1f3;c14:1f2;c15:1f2;c16:1f3;c15:2f2;c16:2f2;c15:3f3;c14:3f2;i16:3f2;c8:6f2;c9:6f2;c10:6f2;c11:6f2;c12:6f2;p13:5f1;c14:6f0;c13:6f1;b14:5f0;r12:5f2;q12:4f1;c7:5f0;c6:5f3;c12:3f2;c13:3f1;q13:4f1;g13:2f2;g12:2f2;i11:4f6;c8:3f0;q8:4f4;g8:5f2;g10:5f2;c9:4f0;p9:2f2;r9:1f3;b9:3f1;q10:2f6;c11:2f3;c11:3f3;g11:5f3;b9:5f2;c10:4f0;g10:1f2;g10:3f2;b11:1f3;c7:2f2;g8:2f2;c6:3f3;c6:4f3;i7:3f2;c7:4f1;

After stealing some ideas from Buttons/Anonymous Guest's solution (most notably, the compact "r/b copy and remember last" structure, and the simpler "carry" implementation - the r/b thing in particular helped me compact/improve so many of my designs, thanks!) (symmetrical):

?lvl=31&code=r10:12f2;p11:12f7;q11:13f3;b12:12f0;q13:13f7;r14:12f0;p13:12f3;c6:6f1;c6:7f1;c6:8f1;c6:9f1;c6:10f1;c6:11f1;c6:12f1;c7:5f2;r7:6f1;r7:7f1;c7:9f2;c7:10f1;c7:12f0;c8:5f2;p8:7f1;g8:8f1;q8:9f2;p8:10f4;q8:11f6;g8:12f0;c9:5f2;b9:6f1;r9:7f1;r9:9f3;c9:10f0;b9:11f1;i10:5f5;c10:6f3;c10:7f3;c10:8f2;g10:10f0;c10:11f1;c11:5f2;r11:6f2;c11:8f2;r11:9f2;q11:10f1;q11:11f0;c12:5f3;p12:6f7;q12:7f6;g12:8f3;c12:9f3;p12:10f7;q12:11f1;c13:5f0;b13:6f0;c13:8f0;b13:9f0;q13:10f5;q13:11f6;i14:5f1;c14:6f3;c14:7f3;c14:8f0;g14:10f2;c14:11f1;c15:5f0;r15:6f1;b15:7f1;b15:9f3;c15:10f2;r15:11f1;c16:5f0;p16:7f1;g16:8f1;q16:9f4;p16:10f6;q16:11f0;g16:12f2;c17:5f0;b17:6f1;b17:7f1;c17:10f3;c17:11f0;c17:12f2;c18:6f1;c18:7f1;c18:8f1;c18:9f1;c18:10f1;c18:11f1;c18:12f1;c17:9f0;c7:11f2;c10:2f3;r11:2f0;g12:2f0;r13:2f2;c14:2f3;p12:3f1;c12:4f1;b13:3f2;b9:3f3;r15:3f3;r11:3f0;i14:3f5;i14:4f1;i10:3f1;i10:4f5;c13:4f0;i15:4f1;c16:4f0;c17:4f0;c18:4f0;c18:5f1;c6:5f1;c6:4f2;c7:4f2;c8:4f2;i9:4f5;c11:4f2;

adding pyramid (combining ideas from my adder with ideas from other's) (quite symmetrical):
To fit the exit in, I had to raise the peak and spoil the symmetry a bit.

?lvl=31&code=r7:11f3;r7:12f2;p8:11f7;c8:12f2;r9:11f2;c9:12f2;b10:11f3;c10:12f2;r11:11f0;c11:12f2;p12:11f7;c12:12f2;b13:11f2;c13:12f2;r14:11f3;c14:12f2;b15:11f0;c15:12f2;p16:11f7;c16:12f3;c16:13f2;b17:11f3;b17:12f0;c17:13f2;c18:8f1;c18:9f1;c18:10f1;c18:11f1;c18:12f1;c18:13f1;c11:13f2;c10:13f2;c9:13f2;c8:13f2;c7:13f2;c6:13f2;c6:12f3;c6:11f3;c6:10f3;c6:9f3;c6:8f3;c6:7f3;c18:7f1;c18:5f1;c18:6f1;g8:9f3;r9:8f2;q9:9f1;c10:8f3;p10:9f7;b11:8f0;q11:9f5;g12:9f3;r13:8f2;q13:9f1;c14:8f3;p14:9f7;b15:8f0;q15:9f5;g16:9f3;c8:10f3;c16:10f3;c12:10f3;c10:10f0;c9:10f1;c14:10f0;c13:10f1;c11:10f1;c15:10f1;g12:2f0;r11:2f3;g12:3f3;c13:3f0;c14:3f0;c18:3f0;c18:4f1;c12:4f3;p12:5f7;b13:4f0;q13:5f5;c14:5f3;r11:4f2;q11:5f1;g14:7f3;g10:7f3;c14:6f3;i10:6f1;c10:5f3;q12:6f7;q11:6f7;q13:6f3;c11:7f0;c13:7f2;c12:7f3;c12:8f3;c11:3f2;c9:6f0;q6:6f0;b7:5f3;p7:6f0;r7:7f1;c8:6f0;b13:2f3;q15:3f1;b16:2f3;p16:3f0;r16:4f1;c17:3f0;

Ophanim (accept if A>B) (symmetrical):

?lvl=30&code=g8:6f1;q8:7f2;q8:9f6;c9:8f0;g10:8f0;r11:7f2;q11:8f1;g12:6f3;c12:7f3;p12:8f7;b13:7f0;q13:8f5;g14:8f2;c15:8f2;g16:6f1;q16:7f4;q16:9f0;q12:5f6;c7:7f2;c17:9f0;q12:9f7;q11:9f0;c10:9f1;p11:13f7;i11:10f5;i11:11f1;c11:12f3;i13:10f1;i13:11f5;c13:12f3;p13:13f7;q13:9f6;c14:9f1;c17:7f0;c7:9f2;p16:8f2;p8:8f0;b9:7f3;b15:9f1;r15:7f3;r9:9f1;g12:10f3;b14:11f2;r10:11f0;p12:11f7;c16:10f0;c15:10f0;c14:10f0;c8:10f2;c9:10f2;c10:10f2;c15:11f2;c16:11f2;c17:11f2;c9:11f0;c8:11f0;c7:11f0;c18:11f1;c18:10f1;c18:9f1;c18:8f1;c18:7f1;c18:6f1;c18:5f1;c6:11f1;c6:10f1;c6:9f1;c6:8f1;c6:7f1;c6:6f1;c6:5f1;p12:4f7;i13:4f1;c14:4f0;c15:4f0;c16:4f0;c17:4f0;c18:4f0;c6:4f2;c7:4f2;c8:4f2;c9:4f2;c10:4f2;i11:4f5;b16:5f1;r8:5f1;c17:10f0;c7:10f2;c13:2f3;c13:3f3;c13:5f3;c11:2f3;c11:3f3;c11:5f3;g12:2f0;r11:6f2;b13:6f0;c11:1f3;c13:1f3;c7:8f3;c17:8f1;

Robobears (begin and end with same color):

?lvl=7&code=c12:8f3;c12:9f3;c12:10f3;c11:3f3;p11:5f2;c11:6f1;c12:4f3;p12:5f3;c12:6f3;c13:3f3;p13:5f0;c13:6f1;c12:7f3;p11:4f4;p13:4f6;

Robotanks (accept if number > 15):

Chain (basic version):

?lvl=15&code=c12:3f3;p12:4f2;p12:5f3;c11:5f3;c13:5f3;c13:6f3;c11:6f3;c11:7f2;c12:7f2;c13:7f2;p14:7f2;c14:6f2;c15:6f2;c16:6f3;c16:7f3;c16:8f3;c14:8f2;c15:8f2;p16:9f3;c17:9f3;c17:10f3;c15:9f3;c15:10f3;c17:11f0;c16:11f0;c15:11f0;p14:11f0;c14:12f0;c13:12f0;c14:10f0;c13:10f0;c12:10f3;c12:11f3;

Pyramid (symmetrical):

?lvl=15&code=c12:3f3;c14:12f0;i13:12f6;c16:12f0;i15:12f6;i9:12f7;c10:12f2;i11:12f7;c8:12f2;c8:11f3;c9:9f3;c9:10f3;p9:11f3;c10:7f3;c10:8f3;p10:9f3;c10:11f3;c11:5f3;c11:6f3;p11:7f3;c11:9f3;c11:10f3;p11:11f3;p12:5f3;c12:7f3;c12:8f3;p12:9f3;c12:11f3;c13:5f3;c13:6f3;p13:7f3;c13:9f3;c13:10f3;p13:11f3;c14:7f3;c14:8f3;p14:9f3;c14:11f3;c15:9f3;c15:10f3;p15:11f3;c16:11f3;p12:4f2;

Big boxy thing (different arrangement of same structure):

?lvl=15&code=c12:3f3;p12:4f2;p10:6f1;p10:8f0;p10:10f3;c12:6f3;c12:7f3;p12:8f3;p14:6f1;p14:8f2;p14:10f3;c12:5f3;p15:6f2;p11:6f2;p9:6f0;p11:10f2;p9:10f0;p13:10f0;c13:5f2;i14:5f3;c15:5f2;c16:5f3;i16:6f5;c16:7f3;c16:8f3;c16:9f3;i16:10f5;c16:11f0;c15:11f0;i14:11f6;c13:11f0;c11:11f2;i10:11f7;c9:11f2;c8:11f2;i8:10f1;c8:9f3;c8:8f3;c8:7f3;i8:6f1;c8:5f3;c11:5f0;i10:5f2;c9:5f0;c12:11f3;c13:8f2;c11:8f0;i10:7f2;i10:9f6;i14:9f7;i14:7f3;p15:10f2;p13:6f0;c13:7f2;c15:7f2;c13:9f2;c15:9f2;c11:9f0;c9:9f0;c11:7f0;c9:7f0;

Engineers (accept perfectly symmetrical strings):

?lvl=24&code=c11:7f0;p12:7f7;c13:7f2;p14:7f6;p10:7f4;q14:6f4;q14:8f0;q10:6f2;q10:8f6;r11:6f3;r13:8f1;b13:6f3;b11:8f1;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;c15:7f3;c15:8f3;c15:9f3;c15:10f0;c14:10f0;c13:10f0;c9:10f2;c10:10f2;c11:10f2;c9:7f3;c9:8f3;c9:9f3;c14:5f0;c13:5f0;c10:5f2;c11:5f2;c12:3f3;c12:4f3;c12:5f3;g12:6f3;c12:2f3;

Seraphim (accept if the input is 2 identical strings, separated by a green):

?lvl=29&code=p12:6f7;p11:6f4;q14:6f2;q10:6f4;r11:5f3;r13:5f3;b11:7f1;b13:7f1;p13:6f2;p14:4f5;p10:4f5;c13:4f0;c11:4f2;c10:5f1;c14:5f1;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;g12:5f3;c12:3f3;c12:4f3;

Robotoast (what?!? don't try and tell me you didn't do this yourself...):

?lvl=1&code=c12:6f2;i13:6f7;c14:6f1;c14:5f0;c13:5f3;i13:7f1;c13:8f3;c13:9f2;c14:9f1;c14:8f1;c14:7f0;c12:7f0;i11:7f6;c10:7f1;c10:6f1;c10:5f2;c11:5f3;i11:6f7;i11:8f5;c11:9f0;c10:9f1;c10:8f2;c12:8f3;

Reply

damn this is fun, a game made for programmers

Academics (reverse the input string) was my favorite so far cause it comes out symmetrical

?lvl=23&code=y12:2f3;b11:5f3;p11:6f0;r11:7f1;p12:6f7;b13:5f3;p13:6f6;r13:7f1;g12:3f3;c12:4f3;c12:5f3;q10:6f0;q14:6f6;c10:7f3;c14:7f3;y10:5f0;r9:5f1;y14:5f2;b15:5f1;p9:4f1;p15:4f5;r8:4f2;r16:4f0;b10:4f0;b14:4f2;q9:3f5;q15:3f1;c10:3f2;c11:3f2;c14:3f0;c13:3f0;c12:7f3;c12:8f3;c12:12f3;c10:8f2;c11:8f2;c14:8f0;c13:8f0;q12:9f2;p12:10f7;r11:10f2;b13:10f0;q12:11f0;

2 left

Reply

Engineers also has a nice elegant symmetrical solution too

?lvl=24&code=g12:2f3;p12:5f3;c12:3f3;c12:4f3;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;c8:2f2;c8:3f1;c8:4f1;c9:2f2;c9:3f2;q9:4f1;p9:5f0;q9:6f7;c9:7f2;c10:2f2;c10:3f3;b10:4f3;c10:5f0;r10:6f1;c10:7f1;c14:2f0;c14:3f3;r14:4f3;c14:5f2;b14:6f1;c14:7f1;c15:2f0;c15:3f0;q15:4f5;p15:5f2;q15:6f3;c15:7f0;c16:2f0;c16:3f1;c16:4f1;c11:2f2;c13:2f0;q11:5f0;q13:5f6;c11:6f2;c13:6f0;

Reply
Anonymous May 25, 2010 5:10 AM

Optimised Robobears in 21 parts:

?lvl=7&code=p12:4f7;c12:9f3;c12:5f3;c12:7f3;c12:8f3;c12:6f3;c12:10f3;c13:3f3;p13:4f0;c13:5f2;c14:4f0;p14:5f7;c15:4f0;c15:5f1;c9:4f2;c9:5f1;c10:4f2;p10:5f7;c11:3f3;p11:4f2;c11:5f0;

Reply
Garth Dickie May 25, 2010 11:34 AM

Here's robobears in 15 parts:

?lvl=7&code=c12:10f3;c12:4f3;c12:6f3;c12:7f3;c12:8f3;p12:5f7;c13:5f3;p13:6f0;p13:7f6;c13:8f1;c12:9f3;c11:5f3;c11:8f1;p11:7f4;p11:6f2;

Reply

Robobears, 15 parts:

?lvl=7&code=c12:9f3;c12:8f3;c12:10f3;p11:4f2;p11:5f4;c11:6f1;p12:4f7;c12:5f3;c12:6f3;p13:4f0;p13:5f6;c13:6f1;c11:3f3;c13:3f3;c12:7f3;

Reply

Engineers, 31 parts:

?lvl=24&code=g12:2f3;c12:8f3;c12:9f3;c10:2f2;c11:2f2;c14:2f0;c13:2f0;c12:7f3;c12:10f3;c9:2f2;c15:2f0;c9:3f1;c9:4f1;q10:3f2;p10:4f0;r10:5f1;b11:3f3;c11:4f0;c12:3f3;p12:4f3;r13:3f3;c13:4f2;q14:3f4;p14:4f2;b14:5f1;c15:3f1;c15:4f1;q12:5f0;p12:6f3;c12:11f3;c12:12f3;

Reply
Anthony May 25, 2010 1:36 PM

Robo-Cats:

?lvl=6&code=p12:5f2;p12:6f2;p12:7f3;c12:4f3;c11:7f2;c13:7f2;c14:7f1;c14:6f1;c14:5f1;c14:4f0;c13:4f0;c12:8f3;c12:9f3;c12:10f3;

Reply
Automaton May 25, 2010 2:04 PM

Here's my 58 piece solution to Ophanim.
It runs the first three tests in 0:30 and usually runs each of the random tests in under 2:30.
The basic approach is:

1) Strip leading 0s and the first 1 from both numbers.
2) Move the digits from the first number so they interleave with the second number.
3) Check which number is larger.
There are also some early out checks to speed things up.

The solution is:

?lvl=30&code=q11:12f4;q11:13f3;c12:6f2;r12:7f1;c12:8f3;c12:9f3;c12:10f3;c12:11f3;i12:12f1;c13:6f2;p13:7f1;q13:8f1;c13:11f3;p13:12f0;c13:13f1;y14:6f2;b14:7f1;c14:8f0;r14:9f1;q14:10f6;g14:11f1;c14:12f0;b15:5f3;p15:6f6;r15:7f1;c15:8f0;r15:9f3;p15:10f4;b15:11f1;p15:12f7;q16:6f6;g16:7f3;i16:8f6;c16:9f3;p16:10f7;q16:11f0;p16:12f3;c17:8f0;b17:9f3;p17:10f6;r17:11f1;p17:12f7;c18:8f0;b18:9f1;q18:10f0;g18:11f1;p11:6f7;c11:7f3;c11:8f2;c10:6f2;g11:5f3;q11:4f6;p11:3f7;b12:3f0;r10:3f2;g11:2f3;p12:2f5;c13:2f0;

Thanks to the previous posters from whom I've borrowed ideas.

Reply

I don't see any solution posted for Officers.

?lvl=13&code=c13:12f3;c13:13f0;c9:3f2;c10:3f2;c10:4f1;c10:5f1;c11:3f2;y11:5f1;q11:6f0;c12:3f3;c12:4f3;c12:5f3;c13:3f0;q13:6f2;y12:2f2;g13:2f3;p13:10f3;b12:10f2;r14:10f0;q13:11f0;c14:5f1;c14:4f1;c14:3f0;g13:4f0;c9:6f1;c9:5f1;c9:4f1;r11:4f2;r14:6f1;r13:5f1;b10:6f1;p12:6f3;c9:8f1;c10:8f0;g11:8f0;q12:8f7;b13:8f3;c13:9f3;b11:7f3;c12:7f3;c13:7f3;c9:7f1;

Reply

Engineers! in 27 parts:

?lvl=24&code=c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;c12:3f3;p12:4f3;c12:5f3;c12:6f3;y12:2f3;c12:7f3;c14:2f0;c13:2f0;c14:7f0;c13:7f0;r13:3f3;c13:4f2;b13:5f1;q14:3f0;p14:4f2;q14:5f4;c15:4f3;c15:5f3;c15:7f0;c15:6f3;c10:2f2;c11:2f2;c9:4f3;c9:5f3;c9:6f3;c9:7f2;q10:3f6;p10:4f0;q10:5f2;c10:7f2;b11:3f3;c11:4f0;r11:5f1;c11:7f2;

Reply

My time at Ophanim is 0:32. Can anyone beat that? Ophanim means Wheels, but mine looks more like a roller coaster.

I meant that as a challenge, not to entertain you ;-)

Reply
Anonymous May 25, 2010 5:37 PM

Politicians:

?lvl=22&code=y12:2f3;p12:4f3;c12:3f3;c12:6f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;r13:3f0;r13:4f1;b11:4f1;c11:3f2;p12:7f3;p11:7f3;p10:7f3;p9:7f3;p8:7f3;p7:7f3;p6:7f3;p13:7f3;p14:7f3;p15:7f3;p16:7f3;p17:7f3;p18:7f3;q12:5f2;

Piece of cake!

Reply

@automaton

I pressed submit, page refreshed, and then I saw your post. Mine works with exactly the same algorithms but is a crazy big cramped snake, with added exits because the lack of space forces it to have exits that dump the rejected subjects onto the conveyers of another loop.

?lvl=30&code=y12:2f0;p11:2f4;c11:1f3;q11:3f3;g12:3f2;p13:3f2;c13:2f3;r10:4f2;p11:4f1;b12:4f0;c14:3f2;c15:3f2;c17:3f2;c16:3f2;c18:7f3;c18:9f3;c18:11f3;c18:10f3;c18:6f3;c18:5f3;c18:4f3;c18:3f3;i18:8f5;c18:12f3;c18:13f0;c17:13f0;c16:13f0;c15:13f0;c14:13f0;c13:13f0;c7:13f2;c8:13f2;c9:13f2;c10:13f2;c11:13f2;c6:11f1;c6:10f1;c6:9f1;c6:6f1;c6:7f1;c6:8f1;q7:11f0;q7:12f4;b8:10f3;p8:11f0;r8:12f1;c10:11f0;c11:11f0;c12:11f0;i13:11f6;i14:11f6;c15:11f0;c16:11f0;c7:2f3;c7:3f2;r7:4f2;p8:2f3;c8:3f3;p8:4f7;c9:2f3;c9:3f0;b9:4f0;g6:1f2;c6:5f1;c6:4f1;c6:3f1;c6:2f1;c7:1f2;c8:1f3;c6:12f1;r11:6f2;c11:7f2;p11:8f0;q12:5f3;p12:6f1;y12:7f1;q12:8f3;g13:5f2;b13:6f0;b13:7f3;p13:8f0;r13:9f1;c14:5f3;c14:6f3;c14:7f3;p14:8f3;g15:5f0;r15:6f2;b15:7f3;p15:8f6;r15:9f1;q16:5f7;p16:6f1;y16:7f1;q16:8f7;b17:6f0;c17:7f0;p17:8f2;y17:9f3;c14:4f3;c13:4f2;c17:11f0;c17:10f3;r8:9f2;b10:9f0;c9:10f3;q8:5f7;q9:5f3;y9:6f3;c8:7f3;c8:8f2;p9:7f3;c10:7f3;c10:8f0;c9:8f3;c14:9f3;q14:10f3;c13:12f3;q9:11f0;y11:9f3;c11:10f3;q13:10f7;c9:9f3;

But somehow yours keeps bouncing between switches while mine travels miles on its conveyers. These facts combined lead to the logical conclusion that maybe speed can be improved further.

Reply

@Automaton

O. I didn't use the same algorithms. Instead of interleaving I just looped around. My way to compare lengths also seems different. Still the same basic Idea.

Reply

Officers, 28 parts:

?lvl=13&code=y12:2f3;g12:3f3;b11:5f2;q11:6f5;c12:5f3;p12:6f3;q12:7f2;r13:5f0;q13:6f1;c13:8f0;c14:6f3;c14:7f3;c14:8f0;b9:4f2;q10:3f3;p10:4f5;r10:5f1;c11:3f2;r11:4f0;c12:4f3;y10:6f1;r11:9f2;p12:9f7;q12:10f0;c12:11f3;c12:12f3;b13:9f0;b12:8f3;

Reply

@Swami:
I tried your Ophanim, and one of the random tests failed: RBBBBBGRBRRRB - rejected when it should have accepted (31>17).
I haven't bothered to determine where the bug is.
I did check through Automaton's in detail and believe it is bug-free, though.

Reply
REVENGE May 26, 2010 1:15 AM

Is it just me, or is there a bug with level 3? I was hunting for the most efficient method, but when I implemented it, I noticed two things: Firstly, it doesn't work all the time, as it seems like one of the input tests can change. Secondly, the times during which it passes all involve having at least 3 blue dots consecutively pass through, not "at least 3".

Reply
REVENGE May 26, 2010 1:24 AM

It looks like there's a bug with level 3. The 5 piece arrangement seems to pass the input test some of the time, and sometimes not. In fact, it only works when you have 3 consecutive blue dots. Someone, please enlighten me if there's an alternate solution in 5 pieces that will pass each input combination.

Reply

It would be really nice if we could rotate selections. You could just add the regular arrows+space bar controls to the selection tool. I often find myself wanting to rotate whole sections of my machine to fit them into the grid better.

Reply

@ Barryd
@ Atomaton

All right, it's not the same basic idea. Automatons solution is beautiful. Mine didn't work.

But: I fixed my solution and beat the time by short cutting a section. New record: 0:29. And now it works on all strings.

This is the basic idea of my Ophanim:

Write a Yellow
Remove reds and the first blue, in the beginning and after the green.
If the same color, remove first in both parts. repeat.
Stop repeating when different colors.
If dot behind the green one was red, add red dot behind yellow
Check which part of the string has most digits left.
Whenever yellow-green occurs, exit
When green-yellow occurs, accept

It's a crazy unmathematical and complicated solution that makes you wonder what spins in the mind of someone who is not an engineer and just starts building a machine and modifies it when it fails. But still, it is fast!

0:29 Ophanim code:

?lvl=30&code=y12:2f0;p11:2f4;c11:1f3;q11:3f3;g12:3f2;p13:3f2;c13:2f3;r10:4f2;p11:4f1;b12:4f0;c15:3f2;c17:3f2;c16:3f2;c18:7f3;c18:9f3;c18:11f3;c18:10f3;c18:6f3;c18:5f3;c18:4f3;c18:3f3;i18:8f5;c18:12f3;c18:13f0;c17:13f0;c16:13f0;c15:13f0;c14:13f0;c13:13f0;c7:13f2;c8:13f2;c9:13f2;c10:13f2;c11:13f2;c6:11f1;c6:10f1;c6:9f1;c6:6f1;c6:7f1;c6:8f1;q7:11f0;q7:12f4;b8:10f3;p8:11f0;r8:12f1;c10:11f0;c11:11f0;i12:11f6;i13:11f6;i14:11f6;c15:11f0;c16:11f0;c7:2f3;c7:3f2;r7:4f2;p8:2f3;c8:3f3;p8:4f7;c9:2f3;c9:3f0;b9:4f0;g6:1f2;c6:5f1;c6:4f1;c6:3f1;c6:2f1;c7:1f2;c8:1f3;c6:12f1;r11:6f2;c11:7f2;p11:8f0;q12:5f3;p12:6f1;y12:7f1;q12:8f3;g13:5f2;b13:6f0;b13:7f3;p13:8f0;r13:9f1;c14:5f3;c14:6f3;c14:7f3;p14:8f3;g15:5f0;r15:6f2;b15:7f3;p15:8f6;r15:9f1;q16:5f7;p16:6f1;y16:7f1;q16:8f7;b17:6f0;c17:7f0;p17:8f2;y17:9f3;c14:4f3;c13:4f2;c17:11f0;r8:9f2;b10:9f0;c9:10f3;q8:5f7;q9:5f3;y9:6f3;c8:7f3;c8:8f2;p9:7f3;c10:7f3;c10:8f0;c9:8f3;c14:9f3;q14:10f3;c13:12f3;q9:11f0;y11:9f3;i11:10f1;q13:10f7;c9:9f3;c12:12f3;g14:3f3;q12:10f0;r17:10f3;

Reply
Inoshiro May 26, 2010 3:16 AM

Were the random test cases a recent addition? I've noticed a few solutions here which pass the preset tests but break most of the time on the randomized ones.

And on that note, has anyone beaten 2:09, 127 parts for a general Metatron solution?

?lvl=31&code=b8:6f2;q8:7f5;g9:5f3;c9:6f3;p9:7f3;c10:5f0;r10:6f0;q10:7f1;b11:4f2;q11:5f1;c12:4f3;p12:5f3;r13:4f0;q13:5f5;c14:5f2;b14:6f2;q14:7f5;g15:5f3;c15:6f3;p15:7f3;r16:6f0;q16:7f1;y17:7f1;c11:3f2;y12:3f3;c16:8f1;c15:8f2;c9:8f2;c10:8f1;q12:6f0;y11:7f3;y13:7f3;b14:2f3;p14:3f0;r14:4f1;c15:2f3;c15:3f0;c15:4f1;r16:2f0;q16:3f0;y17:6f1;c17:5f1;c17:4f1;c17:3f0;q17:10f2;g17:9f1;r17:8f2;y17:11f2;b18:11f1;i14:10f3;c15:10f2;c16:10f2;c18:10f1;c18:9f1;c18:8f1;c18:7f1;c18:6f1;c18:5f1;c18:4f1;c18:3f1;c18:2f1;c18:1f0;c17:1f0;c16:1f0;c15:1f3;c11:8f3;i11:9f1;c11:10f2;i12:10f7;c13:10f2;c13:8f3;i13:9f5;c12:8f3;p12:9f3;c12:11f0;c11:11f0;c10:9f3;c10:10f3;c10:12f2;c11:12f2;c12:12f2;c13:12f2;c14:12f1;c14:11f1;i14:9f4;c14:8f1;c15:9f2;c16:9f1;i10:11f1;c6:3f2;c6:4f1;c6:5f1;g6:6f1;y6:7f1;b7:2f2;q7:3f2;r7:4f2;c8:2f3;c8:3f2;c8:4f1;r9:2f3;p9:3f2;b9:4f1;c7:7f0;q10:3f1;q13:3f3;g12:7f3;q9:11f6;c10:13f2;c11:13f2;r8:11f3;p8:12f2;b8:13f1;q9:12f4;q9:13f5;c7:12f2;c6:9f3;b7:9f0;q7:10f4;c6:10f3;c6:11f2;c7:11f3;c9:10f0;c8:10f0;b16:4f0;y12:2f0;y11:2f3;

Reply

My solution to Androids, a fluke?

?lvl=17&code=c12:4f3;p12:5f3;p13:5f2;c13:4f0;p11:5f0;c11:4f2;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c10:6f1;i10:5f0;c10:4f2;c13:6f2;c14:6f1;i14:5f4;c14:4f0;c11:6f0;

Reply

Semi-ignore all my previous posts on Ophanim. I removed some junk, used the extra space to save on conveyers and cut the time down to 0:28.

Code:

?lvl=30&code=q8:11f0;q8:12f4;b9:10f3;p9:11f0;r9:12f1;c9:13f2;c10:10f3;q10:11f0;c10:13f2;c11:11f0;c11:13f2;r12:6f2;c12:7f2;p12:8f0;y12:9f3;i12:10f1;c12:11f0;q13:5f3;p13:6f1;y13:7f1;q13:8f3;q13:10f0;i13:11f6;c13:12f3;g14:5f2;b14:6f0;b14:7f3;p14:8f0;r14:9f1;q14:10f7;i14:11f6;c14:12f3;c14:13f0;c15:5f3;c15:6f3;c15:7f3;p15:8f3;c15:9f3;q15:10f3;i15:11f6;g16:5f0;r16:6f2;b16:7f3;p16:8f6;r16:9f1;c16:11f0;q17:5f7;p17:6f1;y17:7f1;q17:8f7;c17:11f0;b18:6f0;c18:7f0;p18:8f2;y18:9f3;r18:10f3;c18:11f0;c13:13f0;c8:13f2;c9:8f3;c9:9f2;p10:8f3;c10:9f3;c11:8f3;c11:9f0;c7:11f1;p7:10f1;g7:12f1;c6:10f1;c8:10f1;c8:9f0;c6:9f2;c7:9f1;p7:8f1;b8:8f0;r6:8f2;y10:7f3;q7:7f1;q8:7f5;c8:6f2;c9:6f2;c10:6f3;r12:4f2;p13:4f1;b14:4f0;c15:2f3;p15:3f2;g16:3f3;g14:3f2;c15:4f3;c16:4f0;y12:2f2;p13:2f2;c13:1f3;q13:3f3;

Reply
Inoshiro May 26, 2010 4:32 AM

@Swami: I also found a 27 part Engineers solution that I think is probably minimal - I'm guessing you discovered it too but posted your old code as it's 39 parts :) Here's mine:

?lvl=24&code=g12:2f3;p12:3f7;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;c14:3f1;c14:2f0;c13:2f0;c10:4f1;p10:5f4;r11:4f2;q11:5f1;c12:4f3;p12:5f7;b13:4f0;q13:5f5;c14:4f1;p14:5f6;c11:3f3;c13:3f3;c10:3f1;c10:2f2;c11:2f2;

And ignore most of my previous post, I was having some browser trouble with comments, I've now found the announcement about randomized tests and some interesting Metatron solutions :)

Reply

@Inoshiro

You are right, that's the one. I accidentally posted the solution of EyeKey that is faster but bigger.

Reply

Here's a faster 27-part solution to Engineers:

?lvl=24&code=c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;c12:3f3;p12:4f3;y12:2f3;c12:6f3;c12:7f3;q13:4f2;c13:5f0;c10:2f2;c11:2f2;c13:2f0;r13:3f3;c14:2f0;q14:3f0;p14:4f2;b14:5f1;c12:5f3;q10:3f6;p10:4f0;r10:5f1;b11:3f3;q11:4f4;c11:5f2;

Not sure I can improve it any more.

Reply

Heres a solution for robocat

You have to place 3 check up things, if the first blue go to second if this is also blue go to third if this is end of string it is right. Everytime red is seen or if blue is seen on the third it has to go to the beginning.

Reply

Fantastic game, Nicholas, you should be very proud. I found this on Reddit on Monday and I haven't showered or slept yet... curse you and your extremely addictive game. I just finished Ophanim... what a rush. I need a nap before I tackle Metatron, though.

NB: I was annoyed to discover that Ophanim needed to accept leading zeros. I of course discovered this after my solution was built and working for everything without leading zeros. :/ Some clarification would be helpful. You could also make an easier level out of just one of Ophanim's parts, like

only accepting equal-length strings non-destructively (accept the bot with the original input string on its tape)

That was a fun part by itself.

Reply
GMontag May 26, 2010 4:38 PM

KravN, that solution to Androids doesn't work. It will pass RBRB.

Reply
Automaton May 26, 2010 5:06 PM

Here's my 1:27 time, 110 piece solution to Metatron. I've tried to maintain as much symmetry as possible to make the design clear and (hopefully) appealing. It's relatively easy to optimise this solution to get faster and shorter solutions.

The approach is fairly straight forward. I tried more elaborate solutions, but sometimes simple is best!

1) Remove least significant bit of both input numbers and sum them (together with carry flag) writing the result to an output number appended to the end of the sequence.
2) A Green or Yellow counter at the start of the third number indicates the current carry flag. Green=1, Yellow=0
3) Keep repeating step 1, the input numbers are shortened at each iteration.
4) If one number runs out before the other then treat it as if it has extra 0s at the start and continue summation.
5) If both numbers are exhausted then insert an extra blue if the carry flag is still set.
6) Clean up and exit.

Here's the solution:

?lvl=31&code=r7:3f1;b9:3f1;c6:4f1;c6:3f1;c6:2f2;c7:2f2;c8:2f2;q16:4f1;y15:4f1;b15:3f1;y17:4f1;r17:3f1;c18:4f1;c18:3f1;c18:2f0;c17:2f0;c16:2f0;r9:1f3;p9:2f2;c10:2f2;p15:2f4;r15:1f3;c14:2f0;g12:2f3;y12:3f3;c11:2f3;c13:2f3;c6:6f1;c6:7f1;c6:8f1;q8:6f2;q8:8f6;c9:7f0;g10:7f0;b11:6f2;q11:7f1;c12:6f3;p12:7f3;r13:6f0;q13:7f5;g14:7f2;r15:6f3;c15:7f2;b15:8f1;q16:6f4;p16:7f2;q16:8f0;c18:6f1;c18:7f1;c18:8f1;c6:10f1;c6:11f1;c6:12f1;g7:10f3;r7:11f3;c7:12f0;c8:12f0;b9:11f3;c9:12f0;y15:10f3;b15:11f3;c15:12f2;q16:10f3;c16:12f2;g17:10f3;r17:11f3;c17:12f2;c18:10f1;c18:11f1;c18:12f1;g8:5f1;g8:9f3;g16:9f3;g16:5f1;c12:5f3;c6:5f1;c18:5f1;c18:9f1;c6:9f1;g12:4f3;q11:4f5;q13:4f1;c11:3f3;c13:3f3;c14:8f1;q17:7f2;c17:6f1;c17:5f0;q12:8f3;q13:8f6;r11:10f2;c12:9f3;p12:10f7;q13:9f3;b13:10f0;c14:9f3;c14:10f0;q12:11f6;c12:12f3;p8:7f4;q7:7f4;c7:6f1;c7:5f2;r9:6f3;b9:8f1;q8:4f1;y9:4f1;g7:4f1;g9:10f3;q8:10f3;

Reply

Finished Metatron, and I'm sitting here with my mouth open at how beautiful this thing is... maybe it's the 48 hours with no sleep, but this might be the most beautiful thing I've ever seen. I'm sure it's not the most efficient (1:43 and 115 parts), but it just seems so elegant:

?lvl=31&code=g12:2f2;g13:2f3;c11:3f2;b11:4f2;q11:5f1;c12:3f3;c12:4f3;p12:5f3;c13:3f0;r13:4f0;q13:5f5;c6:2f1;c6:3f1;c6:4f1;c6:5f1;c6:6f1;c6:7f1;c18:2f1;c18:1f0;r9:1f3;p9:2f2;b9:3f1;y10:1f3;q10:2f0;g10:3f2;c7:1f2;c8:1f2;c7:4f2;c7:5f1;g8:3f2;q8:4f2;p8:5f4;q8:6f6;g8:7f0;r9:4f3;c9:5f0;b9:6f1;g10:5f0;y14:1f3;q14:2f6;g14:3f0;b15:1f3;p15:2f0;r15:3f1;c17:1f0;c16:1f0;g14:5f2;r15:4f3;c15:5f2;b15:6f1;g16:3f0;q16:4f4;p16:5f2;q16:6f0;g16:7f2;c17:4f0;c17:5f1;c17:7f2;c18:3f1;c18:4f1;c18:5f1;c18:6f1;c18:7f1;y6:1f2;c7:7f0;c7:10f2;g7:11f1;q7:12f2;y7:13f1;c8:10f2;b8:11f3;p8:12f0;r8:13f1;c9:10f2;b9:11f1;c9:13f0;b10:9f2;i10:10f4;q10:11f4;c10:13f0;c11:9f3;i11:10f7;i11:11f6;c11:12f3;c12:10f3;p12:11f3;i13:9f6;c13:10f0;c13:11f2;r14:9f0;i14:10f0;q14:11f2;c14:12f3;c14:13f2;c15:10f0;r15:11f1;c15:13f2;c16:10f0;r16:11f3;p16:12f2;b16:13f1;c17:10f0;g17:11f1;q17:12f4;y17:13f1;c11:13f2;q12:6f3;c14:6f1;q13:6f6;c13:7f3;c12:9f0;c13:8f3;q12:12f7;c13:12f2;y10:12f3;

Approximate outline:
- merge pairs of digits into a third string, using the rules R+R=R, R+B=B, and B+B=YR (representing a "carry" to be resolved later)
- this is done from the end of the strings to the beginning so non-equal string lengths will still work (turns out this isn't a requirement?)
- once both strings are empty, move to the bottom half of the diagram, where:
- a Y (carry) by itself or following a R turns into a B, representing 0+1 = 1
- a Y following a B turns into YR, representing 1+1 = 10, moving the carry to the previous column
- if a Y is ever processed, the rest of the string is copied and it goes back to the loop top
- if a green is reached without any Ys, the computation is complete

I just can't believe how symmetrical it turned out. It's gorgeous...

Reply
wccanard May 26, 2010 5:43 PM

Ha ha ha! I made it to metatron and thought "hey this is easy: to compute A+B just subtract one from A and add one to B continuously---I've done this already!". Exponential time but just ram speed up to max and hope for the best. **three days later** it's just finished and I've beaten the game ;-) Gets _really_ slow near the end---reading and writing from the tape becomes very inefficient when you've written and removed several thousand characters from it.

Reply

@Swami:
0:28 is fast! Wish I had the time to look more carefully at how it works (maybe later.. but this game already took soooo much of my time - it's only because Automaton's solution intrigued me so much I looked closely last time).

Anyway, you made me feel guilty re. my comments about engineers as distinct from non-engineers.
But for many people, the skills (like abstraction and logic) to compose something of hundreds of parts that is actually reliable, are quite unknown.

Reply
Inoshiro May 27, 2010 12:24 AM

Metatron in 1:12, 100 pieces! Pretty pleased with this.

It's the same 1 bit add with carry that everyone uses, but I redid it from scratch after learning some tricks optimizing earlier problems, and stole a couple more from Automaton (mainly pointing the output bit writers straight into the result copier gizmos), then made every layout optimization I could find. I also make use of the fact that leading zeros in the output are accepted.

Code:

?lvl=31&code=b6:2f2;y6:3f1;c6:5f2;c6:6f1;g6:9f3;b6:10f2;c7:2f2;q7:3f5;g7:4f1;q7:5f2;p7:6f4;q7:7f6;g7:8f3;q7:9f7;c7:10f2;c8:2f2;g8:3f2;r8:5f3;c8:6f0;b8:7f1;r8:8f2;g8:9f1;c8:10f2;c9:2f2;r9:3f2;c9:4f2;c9:5f1;i9:6f0;c9:7f1;p9:8f1;c9:9f1;c9:10f1;c10:2f3;p10:3f7;q10:4f5;g10:6f0;b10:8f0;b11:3f0;c11:4f2;b11:5f2;q11:6f1;g12:2f3;y12:3f3;g12:4f3;c12:5f3;p12:6f3;r13:3f2;c13:4f0;r13:5f0;q13:6f5;c14:2f3;p14:3f7;q14:4f1;g14:6f2;c14:7f1;b14:8f2;c15:2f0;b15:3f0;c15:4f0;c15:5f1;i15:6f4;c15:7f1;p15:8f5;c15:9f1;c15:10f1;c16:2f0;y16:3f0;b16:5f3;c16:6f2;r16:7f1;r16:8f0;y16:9f1;c16:10f0;c17:2f0;q17:3f5;g17:4f1;q17:5f4;p17:6f6;q17:7f0;g17:8f3;q17:9f3;c17:10f0;r18:2f0;g18:3f1;c18:6f3;c18:7f0;y18:9f3;b18:10f0;q12:7f6;q12:8f6;c13:7f2;c11:9f3;b11:10f2;q12:9f7;p12:10f3;q12:11f6;c13:9f3;r13:10f0;c13:8f1;c12:12f3;

Reply
Inoshiro May 27, 2010 1:24 AM

Just for kicks, Engineers...

with 2 symbol memory. The extra overhead keeps it slower than the 1 symbol approach even for max length inputs, although I'm probably missing lots of optimizations.

Code:

?lvl=24&code=i12:8f6;p12:9f3;i12:10f7;c13:8f0;c13:9f2;c13:10f1;q12:11f0;p12:12f7;p11:12f3;p13:12f3;c11:13f2;c13:13f0;c6:10f1;p15:11f3;p16:11f2;c8:10f0;c16:10f2;c18:10f1;i18:9f4;r14:8f0;c14:9f2;r14:10f0;q15:8f4;p15:9f6;q15:10f0;q9:8f2;p9:9f0;q9:10f6;c10:9f0;b10:10f2;b10:8f2;c11:8f3;c11:9f0;c11:10f2;p9:11f7;p8:11f0;q8:9f1;q16:9f5;p17:9f6;c8:3f2;p8:5f0;c9:3f2;p9:5f5;c9:7f1;c10:3f2;c11:3f2;r11:4f3;c11:5f2;r11:6f3;c11:7f2;p12:4f7;c12:5f3;p12:6f7;c12:7f3;b13:4f3;c13:5f0;b13:6f3;c13:7f0;p15:5f1;c15:7f1;p16:5f2;g7:10f0;g17:10f2;i6:9f0;p7:9f4;c12:3f3;g12:2f3;c16:3f0;c15:3f0;c14:3f0;c13:3f0;g8:4f1;g16:4f1;c9:6f1;c6:8f1;c6:7f1;c6:6f1;c6:5f1;c6:4f1;c6:3f2;c7:3f2;c15:6f1;c18:8f1;c18:7f1;c18:6f1;c18:5f1;c18:4f1;c18:3f0;c17:3f0;

Reply

@Swami:
I didn't have time, but I looked closely at your solution anyway. I discovered 1 bug in the process, but also a technique that I stole for my own version using the same algorithm, which I'd been a bit stuck on.
The bug and technique:

You increment the length of the remainder of A (the first input), but this increment isn't visible to the length compare unit until after the initial check.
Test case: bbbgbbr

But I liked the technique so I stole it. Alternatives I was considering involved cycling to the next number for just one of the exits from the bit compare, or simply having 2 separate length compare units with different configurations.

The result is this solution for Ophanim (0:30, 100 parts):

Basic style: normalise, bitcompare, lengthcompare
Algorithm notes:

This basic strategy relies on the fact that after normalsation (leading 0s and initial 1 removed), a longer length string always represents a larger number. The early accept/reject in the normaliser are required because with this particular normalisation, the empty string represents 1 and there's no way to represent 0.
We compare from left to right. If the strings are equal length, this compares corresponding bits, and the first (ie. most significant) differing bit indicates the result of the comparison.
However we compare the bits before the length, as it may be difficult to compare the length and retain the information necessary to compare the bits later. If the lengths differ, the length comparison determines the result. If the lengths are equal, the result will be determined by the result of the bit comparison we did earlier.

Length of A is extended by 1 if A>B in the bit compare. This effectively changes the length comparison function appropriate for when A<B in the bit compare into one appropriate when A>B in the bit compare.

Tape notes:

entrance: AgB
after normaliser: BgAg
inside bit compare: AgBg
entering length compare: BgAy
before length compare exit junction (odd cycles): AyBg
before length compare exit junction (even cycles): BgAy

Code:

?lvl=30&code=c10:13f2;c11:13f2;c6:3f3;c8:3f2;c9:3f2;c10:3f3;c6:4f3;c6:5f3;c6:6f3;c6:7f3;c6:8f3;c6:9f3;c6:10f3;c6:11f3;c6:12f3;c6:13f2;c7:13f2;c8:13f2;c9:13f2;c13:13f0;c14:13f0;g7:7f2;r7:9f3;c8:5f2;c8:6f1;c8:7f1;q8:8f1;c8:10f2;b9:4f3;p9:5f6;r9:6f1;b9:7f3;p9:8f0;r9:9f1;c9:10f2;p10:4f3;q10:5f0;g10:6f3;c10:7f3;c10:10f2;r11:4f3;p11:5f4;b11:6f1;r11:7f3;p11:8f2;b11:9f1;c11:10f2;c12:5f0;c12:6f1;c12:7f1;q12:8f5;c12:10f2;g13:7f0;c13:10f2;y13:9f3;y7:10f2;p10:8f3;p7:8f0;p13:8f2;c15:13f0;c16:13f0;c17:13f0;i14:10f7;c14:8f3;c14:9f3;c14:11f3;c14:12f3;c15:8f2;c15:9f1;c15:10f1;c15:11f1;c15:12f1;r16:7f3;p16:8f2;b16:9f1;c16:10f0;p16:11f0;c16:12f0;y17:7f2;q17:8f6;g17:9f2;q17:11f0;c17:12f3;c18:7f3;c18:8f3;c18:9f3;c18:10f3;c18:11f0;c8:1f3;p8:2f4;r9:1f2;g9:2f0;p10:1f7;q10:2f1;b11:1f0;g11:2f0;p12:2f5;c13:2f0;c7:2f0;c6:2f3;

Not as efficient as yours, but I like the simple layout.

Reply

@Inishiro:
It's a tiny improvement, but I prefer red/blue carry because it's easier to visualise the carry as just the next higher bit in the result rather than something special. It reduces your Metatron part count to 98 (1:12, 98 pieces).

?lvl=31&code=b6:2f2;c6:5f2;c6:6f1;b6:10f2;c7:2f2;g7:4f1;q7:5f2;p7:6f4;q7:7f6;g7:8f3;c7:10f2;c8:2f2;r8:5f3;c8:6f0;b8:7f1;r8:8f2;c8:10f2;c9:2f2;r9:3f2;c9:4f2;c9:5f1;i9:6f0;c9:7f1;p9:8f1;c9:9f1;c9:10f1;c10:2f3;p10:3f7;q10:4f5;g10:6f0;b10:8f0;b11:3f0;c11:4f2;b11:5f2;q11:6f1;g12:2f3;g12:4f3;c12:5f3;p12:6f3;r13:3f2;c13:4f0;r13:5f0;q13:6f5;c14:2f3;p14:3f7;q14:4f1;g14:6f2;c14:7f1;b14:8f2;c15:2f0;b15:3f0;c15:4f0;c15:5f1;i15:6f4;c15:7f1;p15:8f5;c15:9f1;c15:10f1;c16:2f0;b16:5f3;c16:6f2;r16:7f1;r16:8f0;c16:10f0;c17:2f0;g17:4f1;q17:5f4;p17:6f6;q17:7f0;g17:8f3;c17:10f0;r18:2f0;c18:6f3;c18:7f0;b18:10f0;q12:7f6;q12:8f6;c13:7f2;b11:10f2;p12:10f3;q12:11f6;r13:10f0;c13:8f1;c12:12f3;r18:9f3;r16:9f1;r6:3f1;r16:3f0;r12:3f3;b8:9f1;b6:9f3;b8:3f2;b18:3f1;c12:9f3;p7:3f1;p17:3f1;p7:9f3;p17:9f7;

Reply

@Inoshiro:
I like your engineers solution. I wonder if you've seen my solution for Officers (increment the input) (1:15, 121 pieces):

?lvl=13&code=c6:1f2;c6:2f1;b6:3f1;b6:4f1;b6:5f1;b6:6f1;b6:7f1;b6:8f1;c7:1f2;r7:3f0;r7:4f0;r7:5f0;r7:6f0;r7:7f0;c8:1f3;p8:2f7;i8:3f1;i8:4f6;i8:5f1;i8:6f6;i8:7f1;i8:8f6;c9:2f3;p9:3f7;i9:4f1;i9:5f6;i9:6f1;i9:7f6;i9:8f1;c10:3f3;p10:4f7;i10:5f1;i10:6f6;i10:7f1;i10:8f6;c11:4f3;p11:5f7;i11:6f1;i11:7f6;i11:8f1;c12:5f3;p12:6f7;i12:7f1;i12:8f6;c13:6f3;p13:7f7;i13:8f1;p14:8f7;c11:1f0;b8:11f3;b9:11f3;r9:12f0;b10:11f3;r10:12f0;b11:11f3;r11:12f0;b12:11f3;r12:12f0;b13:11f3;r13:12f0;c14:7f3;i14:9f1;i13:9f6;i12:9f1;i11:9f6;i10:9f1;i9:9f6;i8:9f1;b6:9f1;b14:11f3;r14:12f0;c8:13f2;c9:13f2;c10:13f2;c11:13f2;i14:10f6;i13:10f1;i12:10f6;i11:10f1;i10:10f6;i9:10f1;i8:10f6;r7:8f0;r7:9f0;b6:10f1;c7:10f0;r16:9f3;p16:10f7;b17:10f0;c15:8f3;p15:9f7;i15:10f1;b15:11f3;r15:12f0;g16:11f2;b18:5f1;b18:6f1;b18:7f1;b18:8f1;b18:9f1;c18:11f1;c18:10f1;c11:3f1;q8:12f1;p7:12f3;r6:12f2;q7:13f3;q17:11f5;r7:2f2;c10:1f0;c9:1f0;c12:3f0;c13:3f0;c14:3f0;g12:2f0;g11:2f1;p15:4f1;q15:3f1;b16:4f0;b17:4f0;b18:4f0;

I used a similar/related technique to...

...buffer a pattern of up to 8 bits, emitting the first bit to make room when the buffer is full. The worst case performance will be better than a basic implementation without buffering, but in the average case this is probably not an improvement, due to the low probability of a long sequence of trailing 1s in a random bit string.

Reply

A much faster one for generals:

Obviously the idea is to look at the last entry of the string. For blue this is easy: change it to red. For red, just look one place in the string ahead and repeat the above. Once you hit a blue, change it to red and fill it up with blue's to the original length.

Code:

?lvl=14&code=c12:3f3;b10:5f1;q11:5f0;p12:5f3;q13:5f2;r14:5f1;g12:2f3;c12:4f3;q14:4f0;y14:3f3;i13:4f0;g13:3f2;r11:6f3;q11:7f3;g12:7f0;b10:7f2;c11:8f3;c10:4f2;c11:4f2;c11:9f3;c11:10f3;c11:11f3;c11:12f3;c11:13f2;

Reply
Inoshiro May 27, 2010 9:19 AM

@barryd:
Huh, I really hadn't thought about red/blue carry - I used yellow/green in my first try and just carried it forward. Nifty! And I hadn't seen that Officers solution either - very nice.

I went straight to a least significant bit approach for that one due to familiarity, but your way is much more pleasingly abstract.

Reply
Automaton May 27, 2010 2:06 PM

I've had a go at minimising the number of pieces needed for Metatron.

I started from my previous solution and took on board the developments of barryd and Inoshiro. The result has lost some of the symmetry of the original because I'm now exploiting the redundancy that was inherent in it.

It runs in 1:12 and uses 70 pieces.

Here it is:

?lvl=31&code=b11:6f2;q11:7f1;c12:6f3;p12:7f3;r13:6f0;q13:7f5;g14:7f2;c15:7f2;q16:6f4;q16:8f0;c12:5f3;g12:2f3;g12:4f3;q11:4f3;q13:4f7;q7:6f2;q7:8f6;c8:7f0;p16:7f6;r15:8f1;b15:6f3;g16:5f1;b14:3f3;p14:4f0;r14:5f1;c17:7f3;c17:8f0;r12:3f3;c16:4f0;g9:7f0;i10:7f2;c10:4f2;c14:8f1;p15:4f4;b15:5f0;r15:3f0;g16:9f0;i14:9f2;i12:9f6;p7:7f4;c6:7f1;c6:6f2;r8:6f3;b8:8f1;g7:5f1;c7:4f2;p8:4f6;r8:5f2;b8:3f2;p9:4f2;b9:5f1;g7:9f2;c8:9f2;b9:9f2;c10:5f1;p10:9f5;r11:9f0;r9:3f3;q12:8f6;q12:10f6;p12:11f7;r11:11f2;b13:11f0;q12:12f6;c13:9f0;c15:9f0;c10:8f1;c10:6f1;c13:10f2;c14:10f1;

Reply

I'm seriously loving this game, but I REALLY wish it had an undo feature. I can't count the number of times I miss clicked the select tool and then dragged, only to delete half of my machine *cry*

Reply
Inoshiro May 28, 2010 12:07 AM

@barryd: Your Officers inspired this Rocket Planes (blues to front)...

copying up to 4 reds to the end per pass :D I only use the simple half of your idea though, since I just want to remember how many reds I need to move to the end, rather than doing local manipulations sensitive to both reds and blues.

?lvl=27&code=g12:4f0;c11:4f0;c10:4f0;p9:4f0;b9:3f3;c8:4f3;c8:5f3;c8:6f3;c8:7f3;c8:8f3;c8:9f3;c8:10f2;c9:10f3;q9:11f3;c10:11f2;c11:11f2;c9:5f2;c10:5f3;p10:6f3;b9:6f2;c10:7f3;c10:8f3;c10:9f3;r10:10f0;c11:6f2;c12:6f3;p12:7f3;b11:7f2;c13:7f2;c14:7f3;p14:8f3;b13:8f2;p15:8f2;r16:8f3;b15:9f1;c16:9f3;c16:10f0;c15:10f0;r14:10f0;r12:10f0;c13:10f0;c11:10f0;c14:9f3;c12:8f3;c12:9f3;c15:7f1;p15:6f1;r14:6f2;b16:6f0;y15:5f2;y16:5f1;y16:4f0;y15:4f0;y14:4f0;q13:4f7;r8:11f2;

Reply

@Inoshiro:
Nice rocket planes. Pity we can't pack the branches more densely for that one (or is there a way?).
If we're not bored of this yet...
Academics (2:25, 81 parts)...

...buffering 2 at a time, similar to your Engineers.
It actually seems that most of these multi-buffered solutions do run significantly faster than the basic versions.

?lvl=23&code=p12:7f7;p15:7f6;p9:7f4;i13:7f3;c14:7f2;i11:7f2;c10:7f0;p15:6f5;p15:8f7;p9:8f7;p9:6f5;r10:6f0;r16:6f0;r14:8f2;r8:8f2;b10:8f0;b16:8f0;b14:6f2;b8:6f2;q9:9f3;q15:9f7;g14:9f0;g10:9f2;r13:9f1;b11:9f1;c13:6f1;c13:8f1;c11:8f1;c11:6f1;c12:5f3;c12:6f3;c16:7f2;c17:7f3;c17:8f3;c8:7f0;c7:7f3;c7:8f3;p17:9f7;p7:9f7;b8:9f0;b18:9f0;r16:9f2;r6:9f2;r7:10f2;b17:10f0;c12:8f3;c12:9f3;c8:10f2;c9:10f2;c10:10f2;c11:10f2;c16:10f0;c15:10f0;c14:10f0;c13:10f0;q12:10f0;q12:12f0;p12:11f7;b13:11f0;r11:11f2;g16:5f1;g8:5f1;q9:5f1;q15:5f5;b16:4f0;r8:4f2;r14:3f3;p14:4f4;b14:5f1;c13:5f2;c11:5f0;b10:3f3;p10:4f6;r10:5f1;r9:4f2;b15:4f0;q13:4f1;q11:4f5;g12:4f3;g12:3f3;c12:2f3;

Reply
Automaton May 28, 2010 10:35 PM

Ok, I thought it was about time I posted some more of my solutions. With these I've tried to keep the number of parts as small as possible, rather than go for fastest time.

My solutions should work for all valid inputs but if they contain bugs, or you have more efficient solutions, then please post a response.

The solutions that are missing from the list are ones where I couldn't improve on the versions already posted by others.

Each level has the time and part count given as well as the full solution.

Androids
(0:38, 12)

?lvl=17&code=c12:4f3;c12:10f3;i12:7f5;p12:8f3;c12:9f3;c12:5f3;g12:6f3;r10:7f2;q11:6f3;p11:7f1;p11:8f4;b11:9f1;

Robotank
(0:39, 28)

?lvl=15&code=c13:3f0;p12:3f5;c10:4f2;c11:4f3;c12:5f3;i11:3f1;c10:2f2;c11:2f3;i11:5f5;c10:5f2;c10:6f1;c12:6f2;i13:6f7;c14:5f0;c13:5f3;c13:7f3;c14:7f0;i13:8f1;c14:9f1;c14:8f0;c12:8f3;c12:9f3;c12:10f3;c12:11f3;p14:6f2;p10:3f4;p11:6f3;p13:9f7;

Robo-children
(2:06, 22)

?lvl=18&code=c12:11f3;g12:3f3;c12:4f3;p12:5f7;b13:5f0;g12:6f3;c10:4f2;c11:4f2;q12:7f7;i11:7f3;p12:9f3;c12:10f3;p11:9f4;b11:10f1;p13:9f6;r13:10f1;c13:8f0;i12:8f6;r10:5f1;i11:5f2;c11:8f1;c11:6f1;

Police
(2:53, 39)

?lvl=19&code=q11:5f5;r11:6f2;r11:11f2;g12:5f3;p12:6f7;y12:10f3;p12:11f7;q12:12f6;b13:6f0;b13:11f0;p12:3f3;b11:3f2;y12:4f3;r13:3f0;y12:2f3;q12:7f4;y11:7f0;q8:6f6;p8:7f0;q8:8f2;b9:6f3;c9:7f0;r9:8f1;i10:7f2;y8:5f1;c8:4f2;c9:4f2;y8:9f2;r10:6f1;c9:9f2;c10:9f1;c10:8f1;b10:4f3;p10:5f6;r11:8f1;p12:8f7;c13:7f0;c12:9f3;b13:8f1;

Teachers:
(1:01, 22)

?lvl=21&code=c12:9f3;c12:10f3;c12:11f3;c12:12f3;p12:8f7;c12:2f3;c12:3f3;p14:8f2;c13:8f2;b14:9f1;g12:5f3;c12:6f3;c12:7f3;c13:5f0;r13:7f2;c14:5f0;p14:7f1;q15:5f1;p15:6f1;c15:7f1;b16:6f0;c12:4f3;

Officers
(2;13, 27)

?lvl=13&code=c12:2f3;c12:6f3;p12:7f7;q11:7f5;r11:6f2;q13:7f1;b13:6f0;y14:7f1;b10:7f3;b13:8f3;c12:10f3;c12:11f3;b14:6f1;p13:9f4;r13:10f1;p14:5f4;q13:5f1;y12:4f3;g12:5f3;c12:3f3;c12:12f3;q12:9f0;q12:8f7;c11:9f2;p10:8f7;r11:8f0;c10:9f2;

Judiciary
(3:21, 62)

?lvl=20&code=p9:10f1;g9:11f1;c9:12f1;r10:9f3;p10:10f2;b10:11f1;q10:12f7;q11:10f7;b11:11f3;p11:12f0;r11:13f1;c12:9f3;y12:10f3;c12:11f3;p12:12f3;q13:10f3;r13:11f3;p13:12f2;b13:13f1;b14:9f3;p14:10f0;r14:11f1;q14:12f3;p15:10f1;g15:11f1;c15:12f1;y12:2f3;q7:6f6;p7:7f0;q7:8f2;y7:9f2;b8:6f3;c8:7f0;r8:8f1;c8:9f2;b9:4f3;p9:5f6;r9:6f1;i9:7f2;c9:8f1;c9:9f1;q10:5f5;r10:6f2;y10:7f0;r10:8f1;y11:4f3;g11:5f3;p11:6f7;q11:7f4;p11:8f7;q11:9f1;b12:6f0;c12:7f0;p12:3f3;b11:3f2;r13:3f0;c12:4f0;y7:5f2;b8:5f2;b12:8f2;q13:8f1;c13:7f0;

Politicians
(0:39, 30)

?lvl=22&code=c12:10f3;c12:11f3;c12:12f3;p12:8f7;c12:9f3;i13:8f3;p14:8f6;r10:7f2;p11:7f1;p11:8f0;r11:9f1;i12:7f5;c12:2f3;p14:9f3;r15:9f0;c13:9f1;c13:7f1;p14:7f1;b15:7f0;r11:4f3;c11:5f2;g12:3f3;i12:4f1;i12:5f5;q13:3f1;p13:4f1;c13:5f1;b14:4f0;c12:6f3;c13:6f1;

Academics
(3:20, 31)

?lvl=23&code=y12:2f3;b10:5f1;y10:6f1;q10:7f0;b11:6f3;p11:7f0;r11:8f1;b11:10f2;c12:3f3;c12:4f3;c12:5f3;g12:6f3;p12:7f3;c12:8f3;q12:9f2;p12:10f3;q12:11f0;b13:6f3;p13:7f6;r13:8f1;r13:10f0;r14:5f1;y14:6f1;q14:7f6;c12:12f3;p10:4f2;r10:3f3;q11:4f5;q13:4f1;p14:4f0;b14:3f3;

Generals
(1:02, 23)

?lvl=14&code=y12:2f3;g12:3f3;p12:5f3;c12:4f3;q11:5f5;b11:4f2;q13:5f1;r13:4f0;r10:5f3;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;q12:12f0;y14:5f1;r14:4f1;p14:3f0;q13:3f1;p10:6f6;b10:7f1;c11:6f2;

Ophanim
(0:30, 58)

?lvl=30&code=q11:12f4;q11:13f3;c12:6f2;r12:7f1;c12:8f3;c12:9f3;c12:10f3;c12:11f3;i12:12f1;c13:6f2;p13:7f1;q13:8f1;c13:11f3;p13:12f0;c13:13f1;y14:6f2;b14:7f1;c14:8f0;r14:9f1;q14:10f6;g14:11f1;c14:12f0;b15:5f3;p15:6f6;r15:7f1;c15:8f0;r15:9f3;p15:10f4;b15:11f1;p15:12f7;q16:6f6;g16:7f3;i16:8f6;c16:9f3;p16:10f7;q16:11f0;p16:12f3;c17:8f0;b17:9f3;p17:10f6;r17:11f1;p17:12f7;c18:8f0;b18:9f1;q18:10f0;g18:11f1;p11:6f7;c11:7f3;c11:8f2;c10:6f2;g11:5f3;q11:4f6;p11:3f7;b12:3f0;r10:3f2;g11:2f3;p12:2f5;c13:2f0;

Metatron
(1:12, 70)

?lvl=31&code=b11:6f2;q11:7f1;c12:6f3;p12:7f3;r13:6f0;q13:7f5;g14:7f2;c15:7f2;q16:6f4;q16:8f0;c12:5f3;g12:2f3;g12:4f3;q11:4f3;q13:4f7;q7:6f2;q7:8f6;c8:7f0;p16:7f6;r15:8f1;b15:6f3;g16:5f1;b14:3f3;p14:4f0;r14:5f1;c17:7f3;c17:8f0;r12:3f3;c16:4f0;g9:7f0;i10:7f2;c10:4f2;c14:8f1;p15:4f4;b15:5f0;r15:3f0;g16:9f0;i14:9f2;i12:9f6;p7:7f4;c6:7f1;c6:6f2;r8:6f3;b8:8f1;g7:5f1;c7:4f2;p8:4f6;r8:5f2;b8:3f2;p9:4f2;b9:5f1;g7:9f2;c8:9f2;b9:9f2;c10:5f1;p10:9f5;r11:9f0;r9:3f3;q12:8f6;q12:10f6;p12:11f7;r11:11f2;b13:11f0;q12:12f6;c13:9f0;c15:9f0;c10:8f1;c10:6f1;c13:10f2;c14:10f1;

Reply


Metatron (3:46, 120 parts):

Technique: collate, reverse, add, reverse
striking layout with 3 clearly distinct parts, one of which is used twice
optimised for cleanness of the layout
partly inspired by Automaton's (0:30, 58) solution for Ophanim
Notes:

The 2 numbers come in the entrance into the collator, which collates them and sends them out through the central junction to the reverse unit on the left, which reverses the collated string. The reverser then sends the reversed string to the adder on the right, which calculates the sum of the numbers, then sends the result back to the reverse unit, which reverses it back to normal and sends the result to the exit.

Collator:
The collator is the large upper structure. It does the ABCabc -> AaBbCc thing. This one keeps the order and pads the shorter number with leading 0s. Note that we don't strip leading 0s in this machine.

Reverse unit:
input: Cg (C = input r/b string)
output: gR (R = reversed r/b string)
It will also preserve any r/b sequences beginning with yellow which are passed before the g in the input. This is how the necessary state information is stored to allow the output to be routed to different destinations. You could potentially use the unit many times.
eg. input Cyg -> output ygR
I abuse this interface a little in the machine, to keep the main junction looking clean.
Also note that the entrance point is also the exit point. It took me a while before I realised I could make that work. My layout really benefits from it.

Adder:
input: collated bit string, from least to most significant bit
output: the sum of the input numbers, from least to most significant bit

I might later rework this to use a more compact collator like the ones from Automaton or Ted. This was just the most obvious way to do it while respecting bit positions. But maybe reversing before collating could mostly solve that problem.

Code:

?lvl=31&code=r18:13f0;r18:9f0;b18:7f0;b18:11f0;c17:7f3;i17:8f5;c17:13f1;i17:12f4;p18:8f6;p18:10f6;p18:12f6;p16:9f0;p16:11f0;c17:9f0;c17:11f0;c16:10f2;c17:10f2;c16:12f2;c16:8f2;c15:13f2;c16:13f2;c7:4f1;q8:4f7;r8:5f2;p9:4f1;c9:5f1;q10:4f3;b10:5f0;g11:4f1;r11:5f2;c12:4f3;c12:5f3;g13:4f1;b13:5f0;q14:4f7;b14:5f2;p15:4f5;c15:5f1;q16:4f3;r16:5f0;c17:4f1;g9:6f1;c10:6f0;q11:6f1;p12:6f7;q13:6f5;c14:6f2;g15:6f1;c10:7f1;q11:7f0;q12:7f7;q13:7f6;c14:7f1;g12:2f3;p10:1f7;b11:1f0;r9:1f2;g12:3f3;i13:3f0;i11:3f4;q14:3f7;q10:3f3;b13:2f1;b15:2f1;r15:1f0;b13:1f2;c14:2f3;c17:3f0;g16:3f1;c16:2f0;q15:3f5;q9:3f1;c7:3f2;c8:2f2;g8:3f1;c10:2f3;r11:2f1;r9:2f1;c14:13f2;c15:11f1;p14:1f3;c13:8f0;c11:8f2;b15:9f3;y14:10f0;c12:8f3;b6:9f3;p6:10f6;r6:11f1;r7:8f2;g7:9f0;q7:10f1;g7:11f0;b7:12f2;p8:8f7;q8:9f1;q8:11f7;p8:12f5;b9:8f0;y9:9f0;p9:10f6;y9:11f0;r9:12f0;q10:10f4;c10:11f3;c10:9f2;q15:10f0;i12:9f7;i13:10f1;c11:10f0;c11:9f2;c13:11f3;c13:12f3;c8:10f2;q10:13f3;c10:12f3;c11:13f2;g12:10f0;g13:9f3;c13:13f2;

It's not fast or tiny, but it's definitely worth looking at.

Reply

Robo children, pretty fast, with huge speed advantage if there are lots of alternating colors; also not big
(0:26, 41)

?lvl=18&code=c9:2f2;c9:3f1;c9:4f1;c9:5f1;c10:2f2;g10:3f2;b10:4f2;c11:2f3;p11:3f3;q11:4f7;p12:3f3;c13:2f3;p13:3f3;q13:4f7;c14:2f0;y14:3f0;r14:4f0;c15:2f0;c15:3f1;c15:4f1;c15:5f1;c12:10f3;c12:11f3;c9:6f1;c9:7f1;b10:6f2;c10:7f0;q11:6f7;c11:7f0;q12:6f7;p12:7f3;q13:6f7;c13:7f2;r14:6f0;c14:7f2;c15:6f1;c15:7f1;c12:4f3;c12:5f3;c12:8f3;c12:9f3;

small as possible (ugly),
(1:10, 24)

?lvl=18&code=g12:4f3;c12:5f3;p12:6f3;i12:7f5;c12:9f3;c12:10f3;c12:11f3;q13:4f1;r14:3f3;p14:4f4;b14:5f1;c15:4f0;b11:5f3;p11:6f0;r13:5f3;p13:6f2;c11:7f2;c13:7f2;c14:7f2;c15:7f1;c15:6f1;c15:5f1;c12:3f3;c12:8f3;

Teachers
(0:49, 20)

?lvl=21&code=r8:2f2;p9:2f1;p9:3f4;b9:4f1;b10:1f3;p10:2f6;i10:3f6;q11:2f5;c11:3f0;g12:2f3;p12:3f3;c12:4f3;c12:5f3;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;

Seraphim, nice and symmetrical
(0:40, 31)

?lvl=29&code=c12:10f3;c12:11f3;g9:3f2;c9:4f1;p9:5f0;r10:2f3;p10:3f2;b10:4f1;b11:4f3;p11:5f0;r11:6f1;y12:3f3;c12:4f3;p12:5f3;c12:6f3;r13:4f3;p13:5f2;b13:6f1;b14:2f3;p14:3f0;r14:4f1;g15:3f0;c15:4f1;p15:5f2;c12:7f3;c12:8f3;c12:9f3;q10:5f7;q14:5f3;q11:3f1;q13:3f5;

I think somebody asked before, but is there an obvious attack on judiciary that isn't

seraphim + police

Reply
Automaton May 29, 2010 11:33 AM

I've developed a shorter solution to Judiciary. This one uses a completely different strategy to the approach I used before. It's a bit slower but 5 parts shorter at (3:36, 57)

Here's the basic approach:

I create a new string by repeatedly taking the first and last elements of the input. This should lead to a symmetric string if the input was repeated.
e.g. bbrBBR -> bRbBrB
It's then just a matter of using a streamlined version of the solution for Engineers to test for symmetry. (The streamlining is possible due to already having eliminated odd length strings.)

Here's the new solution:

?lvl=20&code=c12:11f3;c12:3f3;c12:4f3;i12:5f1;g12:6f3;p12:7f3;i12:9f1;g12:2f3;q12:8f0;c12:10f3;p12:12f3;q13:12f5;r13:11f0;q11:12f1;b11:11f2;g10:12f1;c10:11f1;p10:10f1;g14:12f1;c14:11f1;p14:10f1;c11:10f2;c13:10f0;q9:6f2;p9:7f4;q9:8f6;r10:6f3;c10:7f0;i11:7f2;c11:8f1;g9:9f2;b10:9f2;b11:9f1;c11:6f1;c11:5f0;c10:5f1;g9:5f0;b8:5f1;c8:4f2;r9:4f2;q10:3f5;p10:4f1;b11:4f0;c11:3f2;b10:8f1;r13:6f3;c13:7f2;b13:8f1;r13:9f0;q14:6f4;p14:7f2;q14:8f0;g14:9f0;g14:5f1;r14:4f0;r13:4f3;c13:5f0;

To perhaps make the algorithm clearer, here's my unoptimised implementation that has a nicely symmetric layout:

?lvl=20&code=c12:11f3;c9:3f2;c9:4f1;c9:5f1;c9:6f1;i9:7f2;b9:8f1;b9:9f1;b10:2f3;p10:3f6;r10:4f1;g10:5f2;q10:6f2;p10:7f4;q10:8f6;g10:9f0;q11:3f5;c11:4f0;b11:5f1;r11:6f3;c11:7f0;b11:8f1;c12:3f3;c12:4f3;c12:5f3;g12:6f3;p12:7f3;c12:9f3;q13:3f1;c13:4f2;r13:5f1;c13:7f2;r14:2f3;p14:3f4;b14:4f1;g14:5f0;q14:6f4;p14:7f6;q14:8f0;g14:9f2;c15:3f0;c15:4f1;c15:5f1;c15:6f1;i15:7f3;r15:8f1;r15:9f1;g12:2f3;q12:8f0;c12:10f3;p12:12f3;q13:12f5;r13:11f0;q11:12f1;b11:11f2;g10:12f1;c10:11f1;p10:10f1;g14:12f1;c14:11f1;p14:10f1;c11:10f2;c13:10f0;r13:8f1;b13:6f3;

Reply
Automaton May 29, 2010 11:51 AM

Following 4tran's lead, I've looked at Teachers again and reduced it by another piece. :)

(0:56, 19)
?lvl=21&code=c12:9f3;c12:10f3;c12:11f3;c12:12f3;p12:8f7;c12:2f3;c12:3f3;g12:5f3;i12:6f5;i12:7f1;c12:4f3;p13:8f2;b13:9f1;p13:7f5;r14:7f0;c11:7f1;p11:6f5;b10:6f2;q11:5f5;

I think this goes to show that there are still lots more reductions to be made on many of the existing solutions.

Reply
Hamburger May 31, 2010 1:49 AM

Geez, I'd been racking my brain trying to figure out how you could possibly do Police in 29 parts, until I realized I'd misread Automaton's post and it was *39* parts. That I'd gotten already!

It's nice having parts and times posted; even if you don't want to look at the solutions, it can tell you you're barking up the wrong tree. I had a huge Rocket Planes until I saw someone had finished it in only 20 parts. This made me realize my bubble-sort algorithm just wasn't meant to work, and I rearranged it into more of a selection-sort.

With that, I got it down to 17 parts in 1:35:

?lvl=27&code=y12:4f3;c12:5f3;c10:6f2;y10:7f1;q10:8f0;b11:6f2;r11:7f3;p11:8f4;b11:9f1;p12:6f3;i12:8f1;c12:9f3;r13:6f3;p13:7f4;c13:8f0;q12:10f2;c12:7f3;

Reply
barbrady May 31, 2010 12:32 PM

14 parts androids!!

?lvl=17&code=c12:10f3;p11:6f0;c12:5f3;p12:6f3;c12:4f3;y11:5f3;p10:7f3;y11:7f0;c12:7f3;q11:9f1;q12:9f3;c12:8f3;c10:8f3;c10:9f2;

Reply
Automaton May 31, 2010 5:13 PM

barbrady, you seem to have created a solution that consistently passes all the tests but still contains a flaw! It accepts input of the form xByR where x+y is even. Thus BBBR will be erroneously accepted since 3+1 is even. It needs to only accept xBxR.

The standard tests don't check for this and the random tests don't seem to cover it either (or at least it's improbable they will.) Thus, in order to spot the mistake it's necessary to examine the algorithm. Notice that once red and blue inputs are turned yellow it becomes impossible to tell if there were equal numbers of them.

Reply
Xanthir May 31, 2010 7:03 PM

Slightly smaller *and* faster solution for Academics than Automaton's current solution. Mine is 3:01 and 29 pieces:

?lvl=23&code=g12:5f3;p12:6f3;c12:8f3;c12:9f3;y12:2f3;c12:3f3;c11:8f2;c13:8f0;c12:11f3;c12:12f3;q11:6f0;y11:5f0;p10:6f6;b10:5f3;r10:7f1;g12:7f1;q11:7f2;c12:10f3;q12:4f7;c14:8f0;y13:5f2;q13:6f6;q13:7f4;r14:5f3;p14:6f4;b14:7f1;c13:4f2;c14:4f2;c15:4f3;c15:5f3;c15:6f3;c15:7f3;c15:8f0;

Strategy is basically the same, just slightly cleverer in packing things tightly. Once you enter the main computation space there isn't a single conveyer used until it's done. ^_^

Reply
Hamburger May 31, 2010 10:42 PM

@Xanthir:
Your solution is 3:01 and that's quite a bit faster, true, but you've miscounted. That solution is 33 pieces, not 29. Did you get the wrong one?

Reply

Robomecha:

?lvl=28&code=g12:3f3;c12:10f3;c12:11f3;g10:5f3;r10:6f2;r11:4f2;q11:5f1;c11:6f2;c12:4f3;p12:5f7;c12:6f3;q13:5f5;b13:4f0;g14:5f3;b14:6f0;c13:6f0;r11:7f2;p12:7f7;b13:7f0;q12:8f6;c12:9f3;

Reply
barbrady June 1, 2010 4:26 AM

@Automaton you are right.

Here is a better solution for androids, 12 parts!!:

?lvl=17&code=g12:4f3;p12:6f3;i12:5f5;c12:9f3;c12:10f3;c12:7f3;q11:4f5;r10:5f2;p11:5f1;p11:6f4;b11:7f1;c12:8f3;

Reply
barbrady June 1, 2010 4:39 AM

Teachers 18 parts!

?lvl=21&code=c12:10f3;c12:11f3;c12:12f3;r10:5f2;p11:5f1;p11:6f4;b11:7f1;p12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:2f3;i12:5f5;p13:5f1;b14:5f0;y12:4f3;c12:3f3;q13:4f3;

Notice that BBB RRR BBB and then RR will also be accepted, but this is not against the rules!! XD

Reply
Automaton June 1, 2010 9:40 AM

barbrady, I'm not sure your interpretation of the Accept condition is consistent. If you're prepared to accept something like BRB R then presumably, by the same reasoning, you should also accept BRB B (or any other sequence after the first three tokens.) However, your solution would reject this.

Looking at it another way, we both agree that an empty input is valid (it counts as xBxRxB with x=0) but it's clearly not valid to have 0B0R0BRR (i.e. RR)

Reply
barbrady June 1, 2010 2:14 PM

Automaton you are wrong BRB B is not accepted XD.

Minimalist and superfast robo children

?lvl=18&code=p12:5f3;c12:4f3;c12:3f3;c12:10f3;c12:11f3;c12:8f3;c12:9f3;c10:4f2;c14:4f0;g9:5f1;y15:5f1;i10:5f0;c15:4f0;c9:4f2;i11:4f4;i13:4f0;i14:5f4;r10:6f1;q11:6f7;q12:6f7;q13:6f7;b14:6f1;c12:7f3;p11:5f5;p13:5f5;

There are 2 parts

1st: groups of 2 consecutive R / B are marked with Y / G
2nd: groups of 2 consecutive Y / G are marked with B and R

Reply
Automaton June 1, 2010 3:44 PM

barbrady, I realise that your solution doesn't currently accept BRB B. My point was that if you wish to accept BRB R (because it's not against the rules) then it seems to me that you should also accept BRB B (because it is equally not against the rules.)

Perhaps it would be easiest if you made clear how you interpret the Accept condition. How would you write it so that it's explicit which inputs are allowed and which aren't?

Reply
Automaton June 1, 2010 4:40 PM

Xanthir, that's some very tight packing!

Following Hamburger's comment I was trying to work out how you might have reduced it down to 29 parts. In doing so I noticed that, with a small tweak, it can be done using 28 parts.

(3:09, 28)
?lvl=23&code=c12:8f3;c12:9f3;y12:2f3;c12:3f3;c11:8f2;c12:11f3;c12:12f3;c12:10f3;c13:8f0;c12:4f3;b10:5f3;p10:6f6;r10:7f1;y11:5f0;q11:6f0;q11:7f2;y14:5f2;q14:6f6;q14:7f4;r15:5f3;p15:6f4;b15:7f1;p13:6f3;g13:7f1;i12:6f6;c14:8f0;q12:7f2;c12:5f3;

Reply
Automaton June 1, 2010 6:53 PM

I forgot to mention that I've reduced Robotanks to 26 pieces. No new insights, just a sensible layout.

(0:40, 26)
?lvl=15&code=c12:3f3;p12:4f2;c14:12f1;c14:11f0;i13:11f6;c12:11f3;i12:5f1;p12:6f3;c13:6f1;c13:5f0;c11:5f3;c11:6f3;c11:7f3;i11:8f5;c10:9f1;c10:8f2;c13:8f3;i13:9f7;c13:10f3;c14:8f0;p14:9f2;c14:10f0;c12:8f3;c12:9f2;p11:9f7;p13:12f7;

Reply
Patrick June 2, 2010 12:21 AM

I finally came up with a solution to Rocket Planes that works for all possible inputs, regardless of length! I'm not very good at this, I think, and it took me forever to come up with the process that would accomplish this, and then even longer to figure out how to pack everything into that little box.

Reply
Anonymous June 2, 2010 1:28 AM

Officers (2:13, 24)

?lvl=13&code=c12:3f3;c12:11f3;c12:12f3;c12:2f3;c12:10f3;p10:5f6;r10:6f1;y10:7f1;q11:5f5;b11:6f2;q11:7f5;g12:5f3;c12:6f3;p12:7f3;q12:8f7;r13:6f0;q13:7f1;y12:4f3;c14:7f3;c14:8f0;b13:8f3;p13:9f0;r13:10f1;q12:9f0;

Reply
Anonymous June 2, 2010 3:01 AM

?lvl=18&code=p12:3f3;r13:3f0;g11:3f2;c11:7f3;c11:8f3;i11:9f5;q11:10f3;q10:10f1;c11:11f2;c12:11f3;q12:5f3;y13:5f0;c12:4f3;c11:5f3;p12:6f3;c11:6f3;c13:6f2;c14:6f1;c14:5f1;c14:4f0;c13:4f0;c12:7f0; for robo child its much faster.

Reply
Automaton June 2, 2010 8:45 AM

I've only just noticed that Politicans is not spelt Politicians! Has it always been that way?

Anyway, I've reduced it to 28 parts.

The approach was:

First reduce it to a version of Robo-children.
Then reuse my solution to that.
So if anyone can reduce Robo-children further then you'll immediately gain a reduction in Politicans too!

Here's the solution:

(0:13, 28)
?lvl=22&code=c12:2f3;p12:3f3;y13:3f0;g11:2f2;p11:3f0;y11:4f1;c12:4f3;q12:7f3;g13:7f0;i11:7f2;y10:7f1;c10:6f2;c11:6f2;c12:6f3;b12:5f3;b12:8f3;p12:9f3;i11:9f3;i12:10f1;q12:11f7;q11:11f0;q13:11f2;c13:10f0;c11:10f1;c11:8f1;g11:12f1;y13:12f1;c12:12f3;

Reply
barbrady June 2, 2010 12:14 PM

Robo-children 22 parts

?lvl=18&code=c12:4f3;p12:7f7;c12:11f3;c12:5f3;c12:8f3;c12:9f3;c12:10f3;c12:3f3;g11:7f1;g13:7f2;q14:4f1;p11:6f1;r10:6f2;i12:6f7;p14:7f2;b14:8f1;p14:5f1;r13:5f2;b15:5f0;c13:6f2;c14:6f1;c13:4f0;

Reply
Automaton June 2, 2010 1:52 PM

Here's an updated Robo-children that uses a small innovation to save an extra part.

(1:58, 21)
?lvl=18&code=q11:6f0;g11:7f3;r12:4f3;b12:5f3;p12:6f0;r12:7f1;c13:6f0;c13:7f1;c13:8f1;g12:3f3;c10:8f2;p10:9f4;b10:10f1;i11:8f7;p11:9f3;p12:9f6;r12:10f1;c12:8f2;c11:10f3;c11:11f3;c11:12f2;

As indicated in my last post, the knock on effect to this is:

Politicans
(0:13, 27)
?lvl=22&code=c12:2f3;p12:3f3;y13:3f0;g11:2f2;p11:3f0;y11:4f1;b12:4f3;y12:5f3;g12:6f3;q12:7f4;y12:8f1;p11:7f4;b11:8f3;i11:9f5;q11:10f7;q10:10f0;q12:10f2;g10:11f1;y12:11f1;c10:9f2;c12:9f2;c13:9f1;c13:8f1;c13:7f0;c11:11f3;c11:12f3;c11:13f2;

Reply
barbrady June 2, 2010 9:18 PM

I am completely mad about this game, I love it too much!! here are improved and easy versions of politicians and robo-children.

robo-children (0:32, 21)

?lvl=18&code=c12:10f3;c12:11f3;c10:5f2;c12:5f3;p12:6f3;c14:5f0;g12:3f3;c12:4f3;i13:5f0;i11:5f3;p11:6f5;p13:6f5;r10:6f1;b14:6f1;q12:7f6;c12:9f3;p12:8f3;g11:8f1;g13:8f1;c11:7f1;c13:7f1;

robo-politicians (0:46, 26)

?lvl=22&code=c12:11f3;c12:12f3;c12:3f3;p12:4f3;r13:3f0;r13:4f1;p12:8f3;y12:2f3;q12:5f2;b11:4f2;g12:6f3;b10:8f1;r14:8f1;q12:9f6;p12:10f3;g11:10f1;c11:9f1;g13:10f1;c13:9f1;p11:8f5;p13:8f5;c10:7f2;i11:7f3;c12:7f3;c14:7f0;i13:7f2;

Reply
barbrady June 3, 2010 12:22 PM


Rocket Planes 14 parts.

?lvl=27&code=r12:4f3;y12:5f3;r13:6f0;b11:6f2;p12:6f3;b11:9f2;p12:9f3;b13:8f1;p13:9f0;r13:10f1;c13:7f1;y12:8f3;q12:7f2;q12:10f4;

Reply
Automaton June 3, 2010 1:37 PM

Good work, barbrady. Keep them coming!

Here's a reworked version of Judiciary. It uses a small trick at the start to allow better packing.

(3:42, 54)
?lvl=20&code=c12:11f3;p12:7f3;i12:9f1;q12:8f0;c12:10f3;p12:12f3;q13:12f5;r13:11f0;q11:12f1;g10:12f1;c10:11f1;p10:10f1;g14:12f1;c14:11f1;p14:10f1;c11:10f2;c13:10f0;r13:9f0;g14:9f0;i11:7f2;c11:9f1;c11:8f1;b11:4f2;p12:4f3;c11:6f1;c12:3f3;c11:3f2;c11:5f1;g12:5f3;q12:6f0;y12:2f0;g11:2f3;q9:6f2;p9:7f4;q9:8f6;g9:9f2;r10:6f3;c10:7f0;b10:8f1;b10:9f2;r13:6f3;c13:7f2;b13:8f1;q14:6f4;p14:7f2;q14:8f0;g14:5f0;r13:5f1;r13:4f0;g9:5f2;b10:5f1;r10:4f1;c10:3f2;b11:11f2;

Reply
Automaton June 3, 2010 3:45 PM

I've rearranged Ophanim and clipped off 3 more parts:

(0:34, 55)
?lvl=30&code=c12:2f3;p12:3f2;b8:9f2;q9:8f5;p9:9f5;y9:10f1;g10:8f2;r10:9f0;c10:10f0;c10:12f1;i11:8f7;p11:9f2;c11:10f0;c12:6f3;c12:7f3;i12:8f5;c12:9f3;c12:10f3;c12:11f3;q12:12f0;r13:6f0;r13:7f2;c13:8f2;b13:9f2;b13:10f0;g13:11f0;q14:6f3;p14:7f1;p14:8f2;p14:9f3;q14:10f5;q14:11f7;g15:6f0;b15:7f0;q15:8f5;r15:9f0;g15:10f0;q15:11f3;p16:7f6;p16:8f2;p16:9f6;c16:10f3;p16:11f0;c16:12f1;g12:4f0;c11:4f3;p11:5f3;r12:5f0;b10:5f2;q11:6f0;g11:7f3;p10:11f1;b11:11f1;r9:11f1;c11:12f0;

Reply
Automaton June 3, 2010 6:36 PM

I've pinched another couple of pieces from Metatron. I'd guess there are still more savings to be made though.

(1:24, 68)
?lvl=31&code=p12:11f7;r11:11f2;b13:11f0;q12:12f6;g12:2f3;c6:7f3;c6:8f2;q7:6f2;p7:7f0;q7:8f6;b8:6f3;c8:7f0;r8:8f1;b11:6f2;q11:7f1;p12:7f3;q12:8f6;r13:6f0;q13:7f5;g14:7f2;c14:8f1;r15:6f3;c15:7f2;b15:8f1;g16:5f0;q16:6f4;p16:7f2;q16:8f0;c17:6f0;c17:7f1;g7:5f1;g10:7f0;i9:7f2;q12:10f6;c13:10f2;c14:10f1;i12:9f1;c8:9f2;c15:9f0;i14:9f2;c13:9f0;c11:9f0;c10:9f0;c9:8f1;g12:5f3;c12:6f3;q13:5f7;b14:4f3;p14:5f0;r14:6f1;r12:3f3;i12:4f5;c13:4f3;c9:6f1;c9:4f2;c10:4f2;p9:5f1;c7:4f2;b8:4f2;r8:5f1;b10:5f2;p11:4f6;r11:5f1;b11:3f3;r15:5f0;g7:9f2;g16:9f0;c9:9f1;

Reply

Fantastic game. I loved it. Just finished it after someone showed it to me last week.

It looks like there is a level editor, if I can figure out how to use it. Is there anywhere that we can find levels or challenges made by other people?

And is it acceptable to post pictures of the finished levels, or should we just use the game generated codes?

Reply

Now that's interesting. I'm just reading through some of the comments. On page 3 above there is a response to Swami by barryd and REVENGE about Level 3 being done in only 5 pieces with 5 spaces between the entrance and exit, meaning no provision for loopbacks or corners.

I hadn't realised you can feed into the sides of the colour detectors. Of course this means I will have to check all my machines to remove unnecessary loops and coonveyors. This should dramatically improve the space requirements for my machines :D

Reply
Automaton June 4, 2010 2:14 PM

I just noticed that there is a thread dedicated to optimization of Manufactoria solutions over at Kongregate. Whilst in many cases we have converged on similar solutions, they are further along the optimization path.

They have solutions optimized for speed as well as size. Some of these just rely on good packing, some rely on clever tricks and others use novel algorithms.

So far I've only looked at the size optimized ones and they seem to have improved solutions to:

Officers
(2:31, 18)

Generals
(0:59, 17)

Tanks
(0:39, 25)

Children
(1:51, 18)

Rocket Planes
(1:34, 16)

Police
(2:54, 34)

Judiciary
(3:11, 47)

Politicians
(2:12, 23)

Academics
(3:16, 25)

Engineers
(1:47, 23)

Seraphim
(0:35, 21)

Orphanim
(2:26, 51)

Metatron
(1:04, 50)

Hopefully I've got those numbers right!

Reply
barbrady June 4, 2010 4:07 PM

Yeah using kongregate you have an upgraded version of the game 1.20d, you can share your solutions (I posted a few), and see others solutions.

There is a police solution of 35 parts, i am tried hardly to beat it, but its fucking impossible, II have made 3 different strategies, all working, but always 40-50 parts.

Reply
barbrady June 6, 2010 9:35 AM

Finally!, Police 29 parts

?lvl=19&code=c12:12f3;p10:7f6;c10:9f2;r10:10f1;y11:6f2;q11:7f0;c11:8f3;i11:9f7;p11:10f7;q11:11f1;c12:5f3;i12:6f5;c12:7f0;i12:8f0;g12:9f1;b12:10f1;c12:11f3;y13:5f0;q13:6f2;c13:7f3;c13:8f0;r14:5f3;p14:6f4;b14:7f1;y12:2f3;g12:3f3;g12:4f3;b10:6f3;r10:8f1;

Reply
RVertigo June 12, 2010 6:45 AM

Robospies (0:19, 11)

?lvl=16&code=p12:4f3;c13:4f0;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;p10:5f3;c11:4f3;p11:5f7;c11:6f2;

Robo-children (0:29, 29)

?lvl=18&code=c12:10f3;c12:11f3;c9:3f2;c9:4f1;c9:5f1;c10:3f2;g10:4f1;c10:5f0;b10:6f1;c11:3f2;p11:4f3;q11:6f7;c12:3f3;p12:4f3;c12:5f3;q12:6f7;c13:3f0;p13:4f3;q13:6f7;c14:3f0;y14:4f1;c14:5f2;r14:6f1;c15:3f0;c15:4f1;c15:5f1;c12:7f3;c12:8f3;c12:9f3;

Teachers (1:08, 51)

?lvl=21&code=q7:6f7;p7:7f3;g8:6f0;c8:7f2;q9:6f7;p9:7f3;g10:4f2;g10:6f0;c10:7f2;c11:2f3;c11:3f3;p11:4f3;q11:6f7;p11:7f3;c12:2f0;r12:4f2;g12:6f0;c12:7f2;q12:9f3;r13:3f3;p13:4f2;y13:5f1;q13:6f7;p13:7f3;q13:9f3;c14:4f2;g14:6f0;c14:7f2;q14:9f3;c14:13f0;c15:4f2;q15:6f7;p15:7f3;q15:9f3;c15:13f0;c16:4f2;g16:6f0;c16:7f2;q16:9f3;c16:13f0;c17:4f3;c17:5f3;q17:6f7;p17:7f3;c17:8f3;q17:9f3;c17:10f3;c17:11f3;c17:12f3;c17:13f0;c13:13f0;

Robobears (1:25, 43)

?lvl=7&code=c12:9f3;c12:10f3;c12:6f3;c12:7f3;c12:8f3;p12:4f3;c12:5f3;p10:5f4;c11:4f3;c11:5f0;c10:6f2;c11:6f1;p8:4f0;c10:4f0;c9:4f0;c9:5f3;c9:6f3;c9:7f2;c10:7f2;c11:7f2;c8:3f2;c9:3f2;c10:3f2;c11:3f3;c8:5f1;p14:5f6;p16:4f2;c13:3f3;c13:4f3;c16:3f0;c15:3f0;c14:3f0;c14:4f2;c15:4f2;c13:5f2;c13:6f1;c13:7f0;c14:7f0;c15:7f0;c14:6f0;c15:5f3;c15:6f3;c16:5f1;

Academics (4:24, 43)

?lvl=23&code=y12:2f3;p12:5f3;g11:5f0;c11:3f2;c8:3f2;q8:5f4;c9:3f2;b9:4f3;p9:5f0;r9:6f1;c9:7f2;c10:7f1;c10:6f1;c10:5f0;c10:3f2;c12:3f3;c12:4f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:6f3;y8:6f3;b8:7f2;c8:4f1;c14:3f0;c15:3f0;r15:4f3;p15:5f2;c16:3f0;c16:4f1;q16:5f2;y16:6f3;r16:7f0;c15:7f0;c14:6f1;c14:7f1;g13:5f2;c14:5f2;c13:3f0;b15:6f1;q12:12f2;

Reply
Matanuilover June 16, 2010 3:12 PM

I like how the angels show the first letter in the actual hebrew word, except for Metatron. That letter, mem sofit (or "final mem"), does makes the "m" sound, but it only goes at the end of a word (for those who haven;t guessed, the letter should be normal mem). This is an incredible game, but i found most of the puzzles too hard and i wasn't able to appreciate them.

Reply
Pat Rowles July 21, 2010 10:14 AM

This is an ingenious and hugely engrossing game, which I am delighted to have come across and anticipate will keep me amused for many hours. Thanks and kudos to its creator(s).

However, I have to take issue with the description for the puzzle RC Cars, which specifies "The input, but with the first symbol at the end!" I spent a LONG time trying to solve this before deciding that the grid simply wasn't big enough, and then checked the (valid) solution given by HeroForge's link ?lvl=8&code=p12:6f3;b11:6f3;r13:6f3;c11:7f3;c13:7f3;c11:8f2;c13:8f0;c12:8f3;c12:7f3;

!!! SPOILER !!!

This solution consists of a single B/R Branch, one Blue Writer and one Red Writer. If there is no symbol, the the robot is sent straight to the exit; if the first symbol is Red, then a Red symbol is written and the robot sent to the exit; similarly, if the first symbol is Blue, then a Blue symbol is written and the robot sent to the exit.

It needs to be made clear that the Writers automatically write to the end of the tape, regardless of how many symbols have been read. To my mind, the most literal and logical interpretation of the description is that each robot needs to enter one of two read-until-end-of-tape loops (based on the colour of the first symbol), at the end of which the appropriately coloured symbol is written. After all, how could you arrive at "The input, but with the first symbol at the end!" unless you'd read to the end before doing the writing?

Reply
Pat Rowles July 22, 2010 7:56 AM

My bad - I've subsequently re-read the description of the writer, and it does say that it writes at the end of the tape. That'll teach me to pay closer attention, and not make my own assumptions. Great game!

Reply
Anonymous July 26, 2010 3:05 AM

11 piece bugs

?lvl=5&code=c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;p12:5f3;p13:5f0;c12:4f3;p13:4f0;p11:5f2;p11:4f2;

Reply
ppyromann August 4, 2010 5:03 PM

Engineers! in 25 parts

?lvl=24&code=y12:5f3;p12:6f3;c11:4f2;c12:4f3;c13:4f0;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;q12:12f2;c12:2f3;c12:3f3;p11:6f6;c10:6f2;q11:5f0;b10:5f3;q11:7f4;r10:7f1;q13:5f6;q13:7f2;r14:5f3;b14:7f1;p13:6f4;c14:6f0;

Reply
TEH-PWNERER August 12, 2010 7:58 PM

I tried inputting those answer codes, but they never work for me. Please help.

Reply