I have been working on 6-2 on and off for a while now and I just can't get it from 27 lines down to 24 lines. IDK if anyone is going to read this anyways. I don't want a solution, just a hint if possible. Thanks in advance true < = a < = < A true a = A true b = < B true c = < C true aa = < AA true #puts < & "true" and the start and end #Most condensed intro I could find #moves from start to end AAAAAAAA B = B AAAAAAAA AAAAAAAA C = C AAAAAAAA BBBBBBBB A = A BBBBBBBB BBBBBBBB C = C BBBBBBBB C...

I do not have the user manual PDF's in my game download. I have tried reinstalling and verifying game files but cannot find the manual files. Is there a way to download them or find them somewhere?

I got it down to: a!a=!a!b!a! !a!= != (start)a=b!a! (end)a=!a!b which spreads "endness" from either end using a symmetrical propagation rule that I was quite proud of, but then I need two rules to clean it up afterwards. So what's the solution?...

It took me a long time to realize what this level was asking for, but I finally narrowed it down thanks to the guides. If you still don't understand after that, let me try to explain in a slightly different way: The level is asking "if one letter is different from adjacent letters, return true" but what it should say is "if there is only one instance of a single letter, return true." If there are more than one single character (i.e. baac, B and C) or if the string contains no single characters (i.e. bbc...

Ha, and they told me number theory would never be useful :D # 1,3,5,7 # 1 => a + 0 = n # 3 => 3b + 1 = n # 5 => 5c + 2 = n # 7 => 7d + 3 = n # (minimum) n = 52 => 52x (once) = (start)xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx xa = (end)a xb = (end)b xc = (end)c (start)a = (return)a (start)b = (return)b (start)c = (return)c Because of the 255 character limit, it would even work for inputs of length 9, but after that the number of placeholder cha...