Under rating threshold (hideshow)
I'm pretty sure I did something wrong for Judiciary, given my solution took 128 parts. It was very cramped, but it works for any string with at least 3 spare places (for the "yellow in middle" machine).
Under rating threshold (hideshow)
Terribly addictive. I'm not a "maximizer"-type gamer, but I can't seem to be satisfied with a stage until I'm convinced I have the perfect solution. I keep neglecting IM conversations for 10 minutes while I test an idea.
Under rating threshold (hideshow)
I love how difficult the game is (or maybe I'm just dumb). Some of my programs took a vastly long time to run even at 50x, but I like to think they were very parts-efficient. :)
Under rating threshold (hideshow)
I'm having trouble with some levels, but when I try to copy someone else's solution, all I get is a single dot. I seem to be doing something wrong.
Under rating threshold (hideshow)
My symmetric string reverser for Academics: 41 parts, 5:29
?lvl=23&code=y12:2f3;c12:3f3;p12:4f3;g13:4f2;g11:4f0;p14:4f2;p10:4f0;b10:3f3;b14:5f1;r10:5f1;r14:3f3;q15:4f0;q9:4f0;b8:3f1;y9:3f0;p8:2f1;b9:2f0;r7:2f2;q8:1f3;c10:1f3;c11:2f3;c13:2f3;c14:1f3;c9:1f2;c10:2f2;c11:3f2;c13:3f0;c14:2f0;c15:1f0;q12:5f2;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c12:11f3;c12:12f3;y15:3f2;r16:3f1;p16:2f1;r15:2f2;b17:2f0;q16:1f1;
Under rating threshold (hideshow)
The game is fantastic but I had a hell of a time on just the 3rd level. I must have just been thinking wrong but I'm sure that caused a lot of people to rate it down. Not sure how to fix it.
Under rating threshold (hideshow)
Lol: on the robo-soldier, I had to look into wikipedia how to multiply binaries... when I noticed that it was probably one of the simplest/fastest levels:
?lvl=12&code=r12:4f3;r12:5f3;r12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;
Under rating threshold (hideshow)
btw, for ppl who enjoyed this, the codex of alchemical engineering is one you should try, and then the sequel which is Magnum Opus I think. They are on Kongregate. Also, there should be a link to the maker's page, which has maybe 4-5 games total, but they are worth playing. ESPECIALLY the one with the strange russian/soviet name. Its similar to this, and very VERY hard lol. Good luck completing the whole game! lol. If you do, let me know, because I quit playing after maybe 20 hrs of playing if not more... and that is the ONLY puzzle game Iv played that I couldnt/didnt beat.
Under rating threshold (hideshow)
Whoever is rating this game poorly doesnt seem to understand what a puzzle game is SUPPOSED to be. Flashy graphics are important on action/shooter games etc., sometimes an rpg. Ok. But graphics arent important at all on puzzle games! They're nice, yes, so maybe 1 star off for a few ppl, but theres no reason for this game to NOT have over a 4 star rating! The only reason I think some ppl are rating it low is because they cant solve the puzzles... Puzzles are supposed to challenge your mind, thats the whole idea! If you arent smart enough to solve a puzzle (which I think anyone with enough determination can solve these), that doesnt make it a bad GAME. Honestly, it just makes you either ignorant or impatient or both... Quit rating it low because of YOU lol.
Under rating threshold (hideshow)
Any hints on a general strategy for Ophanim (bonus level 2) would be greatly appreciated. I've contemplated trying to left-fill the shorter string with reds then comparing them bit-wise, or trying some sort of subtraction, but neither seems to be getting me anywhere. There's something obvious I'm not seeing.
Under rating threshold (hideshow)
PleasingFungus: I agree that that's a problem. What I would do is have a list of guaranteed tests (that catch the obvious edge cases - empty string, the minimal accepted string, one 'normal' accepted string, one normal 'rejected' string, and whatever else is obvious for that particular string) and then a couple random ones - even if all the random ones should be failed, the user still has to accept the accepted ones from the fixed inputs.
And of course the "change" ones are much simpler to do this for, but they probably don't need it, either.
Under rating threshold (hideshow)
My last comment was... regrettable. Poorly worded. Also, wrong. And pretty much everyone's been calling me on it.
So: here is the REAL problem with randomly generated strings.
Let’s say we start throwing random strings at the player, instead of pre-made tests. Many of the ‘accept’ levels have pretty stringent conditions – so most of the tests will fail. This means that the player can just run their machine repeatedly and, with a little patience, they’ll end up passing no matter whether their solution is valid or not. (Even if it’s just an empty grid – if all the strings are supposed to fail, then that’ll pass!)
We can start to constrain the strings we give – say, ‘half will accept, and the other half will reject’. Then we start to encounter the problem of randomly generating strings that match a specific pattern. This is a pretty tricky thing to do, in general – and we still have the problem that they may just, well, randomly allow a flawed solution to pass…
Under rating threshold (hideshow)
I don't know if robostilts is SUPPOSD to be this easy, but after looking at some other people's designs I felt compelled to share my super-simple one. ?lvl=10&code=g12:4f3;p12:5f3;y12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;b11:5f2;r13:5f0;
Under rating threshold (hideshow)
Freaking finally. I don't why Judiciary! wasn't the last non-challenge level, because I really feel that it was the hardest. In fact, I had to combine the solutions to THREE other levels to make it work: Police! (to find the midpoint of the string), Academics! (to reverse the second half of the string; if the original was a repeated string, the result would be symmetrical), and Engineers! (to see if the resulting string was symmetrical). The resulting ginormous 119-part monstrosity takes more than 13 minutes to complete, but it works. I'll paste it into the next comment for fear of running out of space.
Under rating threshold (hideshow)
PleasingFungus: Actually, the Halting Problem is not a problem with random generation of strings.
Every stage's definition has to be turing-computable for us to be able to solve them properly, which means you can build a machine yourself that accepts exactly those strings, then use that machine to determine what should be done with the string.
Actually determining perfectly if our machines are RIGHT or not is impossible, of course, because of the Halting Problem, but you can make it much easier to solve it properly than to 'cheat'.
Under rating threshold (hideshow)
here is a custom map, uses all colors and has max space to work with ?ctm=Rainrobo;Leave_only_a_rainbow!;:rygb|bryg:rygb|bgyr:rygb|byrg:rygb|gbyr:rygb;13;3;0;
Under rating threshold (hideshow)
Clean #7 that works for all possible tests ?lvl=7&code=c12:4f3;p12:5f3;p11:5f6;c12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;p13:5f4;p11:6f0;p13:6f2;c11:7f1;c13:7f1;c11:4f3;c13:4f3;
Under rating threshold (hideshow)
mahnat HA well played mahnat i didn't change mine yet to the new research of hwo the switchers move direction but mine was still better than an older post somewhere here
Under rating threshold (hideshow)
There really needs to be a part that checks the color nondestructively. In other words, one that checks the color without erasing it.
Under rating threshold (hideshow)
and my 7 :P
lvl=7&code=c12:4f3;c12:5f3;p12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;p11:6f6;c11:7f3;p11:8f4;c11:9f0;c10:9f1;i10:8f0;c10:7f1;p13:6f4;p13:8f6;i14:8f3;c13:9f2;c13:7f3;c14:9f1;c14:7f1;c10:6f2;c14:6f0;
Under rating threshold (hideshow)
My 7th:
?lvl=7&code=c12:4f3;c12:5f3;p12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;c11:6f0;c13:6f2;p10:6f0;p14:6f2;i9:6f0;i15:6f4;c10:7f3;c14:7f3;c9:8f1;c9:7f1;c15:8f1;c15:7f1;p10:8f3;p14:8f3;c11:7f0;c13:7f2;c11:8f1;c13:8f1;c9:4f2;c10:4f2;c11:4f2;c10:5f2;c11:5f3;c15:4f0;c14:4f0;c13:4f0;c13:5f3;c14:5f0;c8:6f1;c8:5f1;c8:4f2;c16:6f1;c16:5f1;c16:4f0;c9:5f2;c15:5f0;
Under rating threshold (hideshow)
soul4hdwn >> robostilts the easy short and fast way. ?
your solution is rubish heres most fast one
?lvl=10&code=g12:4f3;p12:5f3;b11:5f2;r13:5f0;y12:6f3;c12:7f3;c12:8f3;c12:9f3;c12:10f3;
Under rating threshold (hideshow)
Awesome concept, good graphics (fits the genre), difficult logic, but all in all one of the most intuitive games on Kongregate. Though, I can barely make it through the first few levels (my mind wasn't built for programming) I'll still rate it a 5/5 because for its purpose, its genre, it's a great game. :) Keep doin' what you do best!
Under rating threshold (hideshow)
Here's my police solution: ?lvl=19&code=p11:2f4;r11:1f3;b11:3f1;y12:2f0;y10:2f0;c17:11f0;c16:11f0;c15:11f0;c14:11f0;c13:11f0;i12:11f6;c10:11f0;c9:11f0;c8:11f0;c7:11f0;c6:11f1;c6:10f1;c6:9f1;c6:8f1;c6:7f1;c6:6f1;c6:5f1;c6:4f1;c13:4f3;c13:5f3;c13:6f2;c13:7f1;c13:8f1;p14:6f2;c18:6f3;c18:7f3;c18:8f3;c18:9f3;c18:10f3;c8:5f3;q8:6f7;r9:5f2;p9:6f2;b9:7f2;y10:5f2;y10:7f2;g9:2f0;c11:5f2;c12:5f2;i12:7f7;c10:6f2;c11:7f2;c11:11f0;q11:6f1;y12:6f3;c12:8f3;c12:9f3;p12:10f3;b11:10f2;r13:10f0;q12:12f0;g18:11f0;c17:6f2;q15:6f5;c16:6f2;c14:8f2;b14:9f0;c14:10f1;c15:8f2;c15:9f0;c15:10f0;q16:8f2;y16:9f0;c16:10f0;c17:8f3;c17:9f3;c17:10f0;c14:2f3;r14:3f0;c14:4f2;c15:2f0;c15:3f0;c15:4f2;c16:2f0;y16:3f0;q16:4f6;c17:2f0;c17:3f1;c17:4f1;b16:7f1;r16:5f3;c14:5f1;c14:7f3;c13:9f1;c13:3f3;b7:4f2;p8:4f3;r9:4f0;c8:3f3;c6:3f2;c7:3f2;c8:2f3;
Under rating threshold (hideshow)
Roboplanes: can you make a shortest one?
?lvl=26&code=p12:6f3;c12:5f3;g11:6f0;c10:6f1;c10:5f2;c11:5f2;c12:7f3;q12:8f3;b13:8f1;c13:7f0;c12:9f3;c13:6f1;c13:5f0;
Under rating threshold (hideshow)
Hmm, still having some issues with "Police!" and by extension "Judiciary!." I've managed to create a procedural solution for Police! that finds and marks the midpoint of the string, but it's way too big for me to turn around and reuse in "Judiciary!", and without marking the midpoint I'm not sure how to determine if the string repeats. What have other people come up with?
Under rating threshold (hideshow)
under the assumption there would be no space restriction:
I'd say it is turing complete, as we can simulate a turing-mashine as follows:
for any alphabet, encode it in binary using red and blue.
limit those symbols by yellow dots.
use a single green dot to denote the position of the read/write head (it's easy to move it forward/backward)
now, the swiches, and belts can be used to emulate states, wich enables us to build a deterministic TM.
so, yes, the game actually seems to be turing-complete
((it can emulate any turingmashine, so it is one));
Under rating threshold (hideshow)
Here's a robocats level. It's not short, not easy, but it works.
?lvl=6&code=c12:4f3;p12:5f3;c13:5f1;c13:4f0;c11:5f3;c11:6f3;p11:7f3;c12:6f0;c10:10f2;c11:10f2;c9:10f2;c12:7f1;c10:7f0;c9:7f3;c9:8f3;p9:9f3;c10:9f1;c10:8f0;c8:9f3;c8:10f2;c13:10f2;c14:10f2;c16:10f3;c16:11f0;c15:11f0;c14:11f0;c13:11f0;c12:10f1;p12:9f1;c12:8f2;c13:9f1;c13:8f2;c14:8f1;p14:7f1;i15:7f7;p16:7f2;c16:8f3;c16:9f3;c14:6f2;c15:6f3;c15:8f2;
Under rating threshold (hideshow)
vargilius, yes there are blank inputs (that is to say "robots with no symbols in their tape") where they make sense (for example you could get one if you need to change red for green, but not if you are asked to move the first symbol to the back).
Also, though similar, this isn't a Turing machine (and not just because your state-set is non-infinite). In a Turing machine you can only read an write from the same place, but you can move both forwards and back along the tape.
Under rating threshold (hideshow)
i have no idea how to do the "cat" puzzle...it says to accept only ones that "end with 2 blues", but one STARTS with 3 blues! how the heck do i handle that without rejecting all the others (which also loses)?!
Under rating threshold (hideshow)
Question for someone who's seen all the levels: are you ever given a blank input? Not having to worry about that would make a lot of my designs simpler, if less rigorous.
Under rating threshold (hideshow)
robostilts the easy short and fast way. ?lvl=10&code=y12:10f3;c12:7f3;c12:8f3;c12:9f3;g12:4f3;c12:5f3;p12:6f3;b11:6f1;c11:5f2;r13:6f1;c13:5f0;