Give your circuits a workout in this deceptively simple puzzle game of logic that puts you in control of building a machine designed to test robots for defects. Defects like homicidal tendencies. You know, the usual stuff. When you're done, make use of the level editor, because the best way to show you care for someone is to tie their brain into knots.Read More
Um, it says "right click to advance." Right clicking is bad in flash games. How can I get right lick to work in the context of the game and not bring up the flash menu?
[Actually, it says "Press right to advance", so press either the [D] or right arrow key on your keyboard. No clicking there. :) -Dora]
I disagree, reidsb. It's possible to build machines that can handle arbitrarily large inputs. I'm currently waiting out a later level (Android?) where the input is fifty symbols, and I have every confidence my machine will handle it correctly.
...But it's very slow, because the algorithm I implemented runs in the square of the length of the tape, so I need upwards of five hundred steps.
I think this game is super cool.
Here's one way to handle that sort, to think of it the way a programmer might:
Basically, each of the color-switches acts like an If..Then statement. "If blue, Then go here; If red, Then go there."
So, you'll want three switches here. Each one says, "If it's blue, go to the next one. If it's red, loop back to this step. If it's blank, throw it away."
So each of the first two gates is set up so that the only way to reach the next one is to be blue.
The third gate has a different rule on blue: go to the exit.
This help any?
What I've solved so far:
Toast - Just build a belt to the exit
RC Cars -
Rocket Planes -
I'll have to figure out my actual log-in for this and get it working again, been a while since I posted here. I did a pretty ugly one for Mecha:
If anyone comes up with better, let us know. :)
I have a better one for Mecha. It's even nice and symmetrical! =D
I'm stuck on Officers... It seems so... possible... after Mecha too!
Sorry for double posting, but I didn't see Aegeus' question untill after I posted.
"For RoboBugs, is there a way to make it handle arbitrary length strings?"
I'm fairly sure mine does
Pretty sure this solution to the Robobugs is capable of any length string:
It should reject any double-color.
I like this one the best from Zachtronics. Just seems a lot easier to get the hang of than the previous ones.
This was my solution to the bugs level. I think it's about as simple as you can get. That was back when I was going for elegance (i.e., shortly before just making it function became the issue)
Man, I just now realized you can flip branches with space. That would have made my life a lot easier...
I had trouble getting the previous solutions to RoboBugs(level 5) to load(all I see is a blank screen), but here's my own which should be capable of correctly processing any size string(including length 0):
I gotta admit; it didn't look like much at first, but after a couple of levels it dawned upon me what a truly beautiful game this is. Just finished Mecha, and I found it to be a real hard and interesting puzzle, without ever feeling like I was doing a boring, brainburning exercise.
And it amused me to read someone say that this game is all about "trial and error" because you don't know what robots are coming in advance! :-D Ha ha. If your solution cannot handle *every possible type of robot*, then it's a crappy solution.
Here are a few solutions I'm proudest of.
Politicians (for any length, not just the ones given):
Generals (which is almost exactly a red-blue inversion of my Officers solution):
So could someone explain how to use the level codes that have been posted here? They don't work by entering them into the level editor, and by making a new level, I can see that a level string only describes the I/O and other settings of the level, not the actual component layout.
I've also seen some links where the codes are put after the url to the developer's website in a POST/GET fashion, but that doesn't load the components either. So either way I can't get to see a solution for a particular level.
Hints for rocket planes
You don't need to use yellow marker
You need to mark the end of the string.
you'll need 2 components
one to sort the string
and the other to check the string.If it doesn't match send it back to sorting
if there is a red followed by blue the sorter needs to change them. If there is blue alone it needs to remain there
Great game, but has anyone gotten pasting into the Save/Load box to work on a Mac? I've tried with both Safari and Firefox without any success. There's no mouse cursor, which might be okay since I can still select the existing text, but then hitting Command-V to paste (or even just Delete) immediately dumps me right back into the main game screen with no changes registered. :(
Is there a solution to Judiciary that's not
"Police to make the string look like Seraphim, then Seraphim"? Because I can do that, but 1) I'm not sure I have enough room, 2) I don't want to reconstruct my machines, and 3) that seems like a really poor setup on the part of the level designer. Explanations conceptually, please, I'd prefer to not get "paste the level" responses.
To load/save a solution, open the level and clock on the floppy disk icon.
Here is another solution for Robo-Children:
...replaces a double B with a B and a single R with an R and then does a standard "does B=R" test (from somebody elses solution for an earlier level)
you should make a cycle which
process two bit at a time:
when they are different, cycle back to the same cycle
when they are the same colour,
write a bit for the corresponding green/yellow colour
when no blue or red left, cycle to green-yellow cycle and vice versa
my example(really cool one):
If anyone wants a challenge, here's a level I designed.
Admirals: Accept binary strings that are multiples of three! Level code:
This would be easy on a larger grid: since the corresponding language is regular, you could make it using only branch nodes, with no writers at all. I've tightened up the dimensions to force you to be elegant.
Mecha is infuriating me! It's dead easy to read the first color, but finding when you've reached the last one is a pain in the neck. I considered trying to reverse the string, which makes it really easy, but I can't find a way to do that, either. The tape is a queue, not a stack, so there's no easy way to do it.
Well I've found the solution to mecha
insanity, nice! I figured there should be a O(n) solution to Androids, but all the ones I could find ran in O(n^2).
Here's a relatively simple solution to Engineers:
Yes! Finally! I made a mecha-machine that can take ANY input and put the last symbol in front!
Also, I love this game! Even if I have massive problems wrapping my brain around some of the later problems
Here's my solution to Admirals. I think it's as about as elegant as you can get.
My solution to Admirals
My solution to Admirals
By the way, anyone having luck with
The 3 bonus levels after compleating the normal ones? I got the first, but the second one is killing me!
My solution for Seraphim :
My solution for Seraphim :
I don't seem to get these as fast as the rest of you, but when I do get them, I get them tight:
Efficient script for engineers:
I'll have to post my solutions for them once I get home from work, but to go from Officers to Generals, I changed less than five tiles.
In the meantime, here's my solution to Engineers. It's symmetrical, which is always a bonus. Aegeus, you might be interested in it, as it has a simple (in my opinion) way of checking if you're at the end.
Figured out Ophanim, finally. The basic idea:
First, run through the loop to delete all initial reds from the first and second half. Put a yellow dot at the start of A (and keep the green dot at the start of B). Then use the solution to Seraphim to check where they first disagree. But instead of throwing out the ones that disagree and keeping the others, throw out the ones that do agree and, for the others, check the lengths of the remaining strings to see which is actually bigger.
That's what I set out to do, anyway. Things got REALLY REALLY CRAMPED, and I could've sworn there was still a glitch in this when I hit the Test button. If there is, though, none of their examples seem to have caught it. Here's my solution (141 pieces!):
As for the last bonus level... I've got no idea.
Wow! This is an awesome puzzle! And with many different potential ways of completing it, too. The computer geek in me loves it. This game would actually be a great introduction for any computer science class.
I wonder, with enough tiles, could this game engine (in the right solution) be considered Turing complete?
Syntax - you can copy and paste too? How?
Good rule of thumb for most machines, I've found:
the "null" branch of most sorters should either feed back into the beginning or go straight to the end. This is one way to make sure strings of variable length work. A central conveyer right after the beginning of the puzzle should feed null strings to the exit (usually).
The idea for the police to cut in half:
First you mark the end of the tape with green. This will allow you to setup something that processes the entier tape, and after getting to the end (witch you can check by reaching green), you can restart the loop.
First you have to prepare the tape, by placing yellow at the beginning and end. (By marking the end first with green, you'll be able to know when you'r at the "end" of the tape.
Then what you do in each loop, is that you swap the first yellow backwards, and the second yellow forward. (I'm not going to go into details how, but it's not that difficult)
You keep doing this, until both yellows are next to each other, at witch point you found the middle.
Than there's a bit of cleaning up left and your done.
For Ophanim I cheated.
First I also cut off all the excess reds at the beginning of both halfs, but also as I copied over the rest witch remained after the initial reds, I replaced everything with blue. Then I only checked with of the two is longer. It worked for the test cases, but I guess I should make a proper solution.
And as for the last level
I'm considerably annoyed, as I managed to build an addition machine that works perfectly, except I ran out of room to check if the end condition is met, so it keeps on adding zeroes together.
If anyone is interested in it, here it is:
I'm having a lot of trouble with the later levels, but I think I've come up with some nice clean solutions to a couple of levels.
Ah I think I found an error in your solution, I can't really tell what exactly is going on, but if you try it out for
witch would be 5 and 7, it accepts it as correct.
In case people wonder how to test for a specific input:
Click on the wrentch, use the bottons on the right to enter the color pattern, then move the speed slider from 0. (I took a while to figure out)
Did anyone else have problems with Robocats? I haven't seen it mentioned, but it bugged the heck out of me. I finally beat it, but I think my solution is probably much larger than it needs to be. Any bored folks care to take a look? (in the spoiler)
Anonymous Guest: Yeah, I knew there would be problems for strings of the same length. I'm surprised none came up.
At any rate, for your partial solution to the final level: I watched it long enough to figure out where the ending condition could go, but not quite long enough to figure out how the darned thing works. Still, it only took a few pieces near the bottom to make it operate correctly:
The beautiful thing here is, if I'm not mistaken, you could modify this just a little bit to get a subtraction machine, which also functions as a (much nicer) solution to the penultimate level!
This game is incredible! It almost deserves a place next to The Codex, and that's saying a lot.
I find the later levels incredibly difficult, but I did only just find out that an item can enter a divider from the side; wow - what a difference!
By the way, @amy (long way back); this game is nothing like RoboRally to me. Sure it has the same elements (conveyor belts, robots, humor), but there's a completely different goal, challenge, and rule system. This game isn't a race in any sense of the word.
A solution for robomecha. I think that this might be optimal in both space and time; it's definitely the smallest and fastest solution posted here so far.
Has anybody thought of a way to prove optimality?
I like the idea of using this game as a teaching tool. Here's a problem for y'all to ponder.
Consider the rule, "ACCEPT: Number of reds + number of blues = number of greens + number of yellows," where the input tape can comprise any finite string of those four colors. Can you make a machine that obeys this rule?
You people are all hallucinating or something if you think you solved the stupid lamp level.
yes, it's obvious WHAT you have to do, but not HOW to do it.
there isn't enough space on the board for what you need to do. I've tried about 16 or 20 different combinations and there's just no way. I hate this game. Worse than the stupid Codex.
Bravo! Nicely done! I'm not totally sure how does that fix of yours work, but it does!
Anyway, in case you're interested, here's how the addition works:
I start off by adding a third segment to the tape with an initial red, that is zero. This is where the sum will be stored.
If you look closely, you'll see that the main loop branches off in two directions, than that into two again, and two yet again.
The first branching direction is determined by the last color of the first tape segment (first number).
The second turning is determined by the last color of the second tape segment (second number).
The final is determined by the first color of the third segment (the sum).
So the information of what these three colors are "stored" in the current location on the board. And all we have to do now, is add these three togeather, and write it to the front of the sum.
The last colors we read from the first and second number are discarded (not written back). If one of the number segments is empty, it's treated as zero. Finally if both are empty, we can finih up.
Also for the idea to use it for Ophanim, I though of that as well.
It's not exactly a substraction
This time the third segment that's used as the sum in Metatron consist only of one color. Red for indicating A B.
The basic is same, take each of the last colors of the numbers, and the previous comparison. Based on these information, it's easy to decide the new comparison. And than you just have to handel when one of the numbers run out.
I'm not totally sure how does that fix of yours work, but it does!
Ah, simple: to get to the red-blue branch near the very bottom, the robot has to pass through three consecutive green branches, which means the tape had three consecutive green dots. This happens exactly when you've finished reading both numbers. The three extra conveyer belts are for the times when the robot had just two consecutive green dots: in those cases, we apologize for wasting its time and send it back to where it belonged in the main loop. The blue-red branch with the writers is just to get rid of that pesky green dot at the end without erasing all the hard work we did.
See, now the Bugs level is one of the reasons why this sort of game makes me angry.
There's no way to create a machine in the limited space that rejects ALL sequences of identical colors, and also handles sequences tapes of any length. All of the solutions posted have one of these two flaws.
In other words, you can't craft the solution until you've seen the possible inputs, and selected a solution that will fail for an input that is not provided.
Fail. Not liking it.
I apologize. I didn't search the comments enough to find the proper Bug level solution.
Way too hard, and not enough instructions, especially for Stilts.
They tell you "you can only write to the end of the tape!", then say "Hey, go ahead and write to the beginning of one", with no further instruction. Grrrrrrrrrrr.
JIGuest - Here is my bug level solution, which I'm pretty sure will work for a string of any length - if a color repeats, it gets dumped, otherwise it cycles until it reaches the end of the tape and then goes to the exit.
Streamlined my Children solution, fastest time is 2:41
@ENRAGED: Here, try this:
You can see there are three comparators. When each comparator sees a red symbol, the conveyor belt just pushed the robot back into the comparator again. Three blue symbols are enough to move the robot to the exit; if you run out of symbols, the comparators spit them out.
@ENRAGED a little less:
Since the tape loops around, the easiest way to write to the beginning of the tape is to
Write a green symbol at the end of the tape, then read and write back all the reds and blues until you see something that's not red or blue. At this point, your green symbol will be at the beginning of the tape.
@JIGguest/hotdog: Here's a simpler solution to Robo-Bugs:
The two comparators at the bottom just check for an alternating RBRBR... or BRBRB... sequence (if you ever see RR or BB, then the robot will get spit out one of the sides), and the comparator at the top just determines which of the two comparators the robot gets shoved into.
This works for any sequence, regardless of length.
Parse - here is my solution for Engineers, it is faster, but requires more parts.
Yeah, I won't be finishing this one.
My brain just does not bend in the neccessary ways.
Everything past the 2nd branching is way unnecessarily hard.
Specifically, I probably could figure out some of the remaining levels, but doing so would simply cease to be fun and be a product only of frustrated rage. It's just too much.
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.
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...
My solution for Androids (2:46, 49) - handles any length input (trade elements for speed)
I shaved off 10 more seconds with this monster...
Andy and Cauchy: Are you sure the entire level code is getting copied/pasted properly into the game?
Have you tried typing it out manually by hand instead of copy/pasting just to see if the problem is with the copying and pasting?
What browser are you using? Perhaps your browser is inserting extra (invisible) characters that the game chokes on?
Just some things to consider. I hope that helps.
I think this game was less inspired by robo rally than by a Turing Machine.
We have the tape, with the tape alphabet of yellow, green, blue and red of which red and blue make up the input alphabet, and the finite automaton with the state being the tile the test piece is on. Therefore, we naturally have the start state and the accepting state, while all tiles without any machinerie on them are formely end-states that we would not call accepting state.
Have a look at the wikipedia page and see if you can find the resemblance. You will then have managed a very fundamental concept of computer science!
Hi all, I couldn't find a better way to tell people about this, but I have found what I believe to be a perfect solution to the robocats one. Apologies if people have come up with this before, but I didn't read through all 303 comments.
Essentially have 3 splitters. 2 of them to check whether there is 2 blues, if not, the reds go back to the start, and the blanks get dropped.
On the second splitter, this goes to the third splitter. To go on a conveyor belt, this has to go out the blank, if it is a blue it gets fed back to itself (Remember it has just come from a blue), and if it is a red, it goes back to the start.
Here is the code for it:
Here's what I thought would be a simple little puzzle: Skittles - Accept only strings with one of every color.
Simple right? Except my solution wound up taking the whole board. (And looking a lot like a Space Invader.)
Here's the code:
Hi all... Am I the only one who realised that you can build conveyor "crossings" by pressing SHIFT ONLY WHEN I finally became stuck on Megatron? (facepalm...) Before I had always thought that this game requires you to build redundant mechanisms because there was no "crossing" functionality...
That was a sideword, but I've totally enjoyed this game from start to end. I'm still trying some of the challenges suggested in the discussion, but first my own suggestion... how about try rebuilding your solutions WITHOUT a single bridge? :D
This solution for robochildren evaluates very quickly, I believe a similar approach can be used on some other levels of the same type.
I just beat Manufactoria. The penultimate level, Ophanim, nearly kicked my ass, and I thought Metatron was going to. . . until I built:
112 parts, which is reasonable enough. . . but it runs in 16666:40. That is not a typo. I spent about five minutes watching the test case go at max speed. For some reason I find this hilarious. It works, flawlessly, for arbitrary input, but it does some seriously inefficient stuff to do so. I never bothered stripping off initial reds; if I could squeeze that in, the speed would improve to a sane value, because most of the slowdown comes from adding extra initial reds and looping through them.
For Robomecha this seems to be the best optimization for time that I can think off, and it doesn't require too many extra parts
24parts average 64 time units
Trick that I see is take a guess at what color will show up. So guess blue and half the time you will be able to skip writing out the string a second time to get the last item to the front
After trying the different puzzles you start to see lots of nicer ways of doing things.
Here is a minimized version of serap which is still quiet fast.
(25.94 ave : 23 parts)
trying to read more than one part at a time doesn't seem to speed things up as it has to travel too far to do more checks
I solved all the way through level 30 (Ophanim) without knowing about BRIDGES!! I thought "bridging" meant something like in paint programs where you can click in one spot, then shift-click far away and it draws a line between them. It didn't work so I gave it up and kept solving.
I was despairing of ever solving level 31, but now I know I'll be able to do it!
I found an elegant solution for Mecha if anyone needs it.
I'm pretty sure I have a working solution to "Robomecha" but the Malevolence Engine doesn't seem to think so. Thoughts?
Hi everyone. I want to show You my two solutions to androids (4:23,27) - I think it's smallest working machine (I'm not sure it's always work, but it passes tests) and (6:27,28). Sorry if somebody was first with this.
I'm sorry but many of the solutions (I didn't check them all out) for Androids! will fail the random tests if you repeat the runs a few times. The pass scenario isn't the same number of reds as blues... but some number of blues followed by the same number of red AND there can be multiple sets of these (ex: BRBBBRRRBBRR). Try the idea below...
I believe I have found a solution to Robocat which works with both even and odd blue.
Include the beginning ? mark...
Could more people just post hints please, instead of level codes? I'd really like to be able to find my own solution but sometimes need help with how the mechanism might work. I don't want to just be given a solution that I'm not even building. I could post a few, but some of these even seeing the solution run in front of me I don't understand how it works.
Here's the way I did the robo-cat level correctly:
First off, have the machine print green. Then, set up a branch that reads red without doing anything, and reads blue, then reprints it. After each reading of either red or blue, check for the green dot. If it's read, then that's the end; send it to the accept bin. If not, loop it back to the R/B branch. Make sure it only touches the green writer when it first comes out by putting a conveyor in between the green writer and the R/B branch. Be sure to account for blank strips by placing a green reader on the null side of the R/B branch, and directing the green read to the accept bin.
Leave a comment [top of page]
(Please allow page to fully load for spoiler tags to be functional.)
I've been yearning for a hint-through / concept-through walkthrough for this game, rather than copy-and-pasting solutions over my own work. So, here's a descriptive walkthrough for the ones I've solved thusfar. (Credit given when I didn't figure out the solution myself.)
You want a string with no red, and the only way to get there is to have it look at every dot. Set up a conveyor belt with a branch whose directions are, "If you see a red, dump the string. If you see a blue, send the string backwards and keep looking. If you see nothing, it means the whole string has been checked and there weren't any reds, so accept it."
Your first branch should divide strings into two categories: strings that start with red, and strings that start with blue. Set up a Figure-8 loop of sorts, made of two branches, one of which rejects reds but keeps blues in the loop, and the other of which rejects blues but keeps reds in the loop. Set up your initial branch so that strings starting with red are checked on the reject-red branch first, and strings starting with blue are checked on the reject-blue branch first. Achieving a null string means the robot passes, so send the branches' nulls to the finish.
Here's the two best hints I can give you:
1. If, on any of your splits, you see a red, send the string back to the beginning.
2. The solution I found has a flaw: it will accept strings that end in even numbers of blue, but erroneously reject strings that end in odd numbers of blue above 2. The only passing test cases presented end in 2 or 4 blue dots, so mine works for the game's sake, but I don't have good advice on a flawless solution.
Don't make this harder than it is. Make a branch to check the first symbol. Write that symbol. Send it out the door.
Set up a conveyor belt leading to a branch: blue dots get a green punch and get sent back to the beginning; red dots get a yellow punch and get sent back to the beginning; nulls mean that only green and yellow remains, so send it out the door.
Punch a green dot first thing. Set a splitter make two little loops: if you see a blue, punch a blue; see a red, punch a red; in both cases, send it back to the same branch after punching the dot. Eventually, it'll get back to the green dot and register a null; give it a yellow and send it on its way.
Divide the board into two big halves: Starts with Red, Starts with Blue. On each half, set up loops: if you see the starting color, go to a branch that sends nulls to the finish. If you see the opposite color, go to a branch that sends nulls to the trash. On both of those "deciding" branches, if any other color is seen, go back a branch and keep checking. Be sure to account for one-dot strings.
Odd numbers will always end in a blue dot, right? So make a machine that only accepts strings ending in a blue dot. If you solved RoboCats, you can solve this.
Androids, hints courtesy insanity and Sam Dulmage:
You should make a cycle which
process two bits at a time:
When they are different, cycle back to the same cycle.
When they are the same colour,
Write a bit for the corresponding green/yellow colour.
When no blues or reds are left, cycle to the green-yellow cycle and vice versa.
Sam Dulmage's explanation:
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.
In other words: 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...
First off, mark the end of your string with a green dot. Then build a bizarro-world version of Robostilts: see a red, punch a blue. Loop the string through this branch until it sees null (which is actually the green, of course), then send it through one last green/yellow branch to strip off the green dot and send it out the door.
Don't make this harder than it is: you should only need to place seven tiles to complete this, and two of them are only conveyor belts to reach across the board. Mark the end of the string with a green, then make a branch that punches blue when it sees blue, and just conveyors back to the branch when it sees red. Once the red/blue branch sees the green as a null, send it to a yellow/green branch to ditch the green dot and send it off.
Think of this in three tasks, that must be accomplished in order:
1. Figure out the last color.
2. Stamp that color.
3. Stamp the rest of the string behind it, but without stamping the last color a second time at the end.
First of all, mark a green dot so you know where the string ends. Then, send the string through a red/blue branch that will divide your workspace into two halves. Each side of the branch should re-stamp the dot removed, then check for the green dot. If it doesn't see the green dot, send it back to the original branch to try again. If it does see the green dot, hooray! It's just finished the string! Mark that spot with a yellow dot, then stamp the same red/blue color it just stamped a second time--after all, that was the last color, so now you're stamping it as the first color.
Now, onto step 3: rewriting the string with the last color removed. Make a red/blue branch similar to the original one, except this time, check for the yellow dot before re-stamping the dot removed by the branch. When it sees yellow, follow the yellow dot road (sorry) to the finish.
This one is really most beautiful if you do the math. This is the 8x multiplication table, in binary:
1 x8 = 1000
10 x8 = 10000
11 x8 = 11000
100 x8 = 100000
...and so forth. You see the pattern, right? Isn't that cool?
Oh fine. Anything in binary, multiplied by eight, simply adds three zeros to the end. And three reds and send it out the door.
Step 1: Set up a loop to strip off any leading reds. They're meaningless; the number 00001 is the same as just 1. Once it hits a blue, proceed.
Step 2: Anything in binary that is greater than 15 will necessarily have five dots. We don't care what those dots are, since we already made sure that the first one is a blue. Set up branches that allow anything non-null to proceed, and anything null to get dumped, until five dots have been processed. (Don't forget: you already stripped off one blue dot when you were checking for leading reds.) After your branches have seen five dots, send them home--you don't even need to look at the rest of the string to see whether there are more dots left.
Robospies (elegant solution courtesy buttons):
Like in Robotanks, strip off any leading reds first.
Like Soldiers, this puzzle is elegant once you look at the math. This is the 4^ table in decimal:
4^1 = 4
4^2 = 16
4^3 = 64
4^4 = 256
4^5 = 1024
And here it is in binary:
4^1 = 100
4^2 = 10000
4^3 = 1000000
4^4 = 100000000
4^5 = 10000000000
See the pattern? A one, followed by an even number of zeros. Isn't binary cool? If this isn't enough of a hint:
The rules you need to set up are:
Once you see that first blue, there cannot be any others. See a second blue, dump the string. Also, there must be an even number of reds, so if you see a red, immediately check for a second red. If there's not one, dump it.
Anything that passes these two rules passes.
I'm not able to speak to how to solve the remaining puzzles--I'm stuck on them too. :-)
Posted by: scottique | May 21, 2010 3:42 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.
Posted by: Automaton | May 28, 2010 10:35 PM