If you lost a splitter but can't get it back, you either discovered a bug or the interface isn't clear to you. Because once a component is available, you always have an infinite supply of it.I discovered a bug. There was no splitter in the supply, just one that I got on the field during level 12. But now that I opened the game again, it is there in the supply.
This reminds me of Trainyard and Refraction, two mobile games. Has he tried those?
I'd like an easy "clear-the-board" option, and also to clear the board in between puzzles.
You can get four stars? What.
You can get four stars? What.
Well they're rare and don't hold up very long. When you do better then the currently best known solution you get 4 stars.
The server doesn't accept it automatically as a new best though, and when David wakes up tomorrow he'll probably check it and update the scores.
Then my 4-star solution becomes a 3-star solution, and at the same time everyone else having 3 on this level drops to 2 stars.
Until then, blue is pretty.
Well, I've got 2 stars on 15...
I am going to stop playing now before my completionist side takes over completely.
Well, I've got 2 stars on 15...
I am going to stop playing now before my completionist side takes over completely.
Just finished 15 with 3. I think the only one I've missed 3 stars on is 8.
Well, I've got 2 stars on 15...
I am going to stop playing now before my completionist side takes over completely.
Just finished 15 with 3. I think the only one I've missed 3 stars on is 8.
I've got 3 stars on 15 and 8! But only 2 on 7 and 13. :'(
I only have 2 stars on 16-18. And then in 19, I have no idea how these custom tiles work. The Help isn't very clear about it.
How are you gonna supposed to solve 17 with 4 tiles???
How are you gonna supposed to solve 17 with 4 tiles???
Haaaaa, I got it! :D
How are you gonna supposed to solve 17 with 4 tiles???
Haaaaa, I got it! :D
So the custom tiles are only there to save room, not to lower a score. (That is, 18 optimized to 3 stars, placed as 2 Custom Tiles in 19 (one spun 90 degrees) does not produce a 2 Tile solution, rather a 14 tile solution - or the 7 tiles each used in the custom tiles).
Just did 43 in 9 tiles, thinking it was a very elegant and genius solution. Getting 1 star for that was depressing.
I haven't been going for stars :P.
I haven't been going for stars :P.
I haven't been going for stars :P.
Fiiiiine.
34 tiles for level 20, hahaha.
I can't figure out how to get fewer than 6 tiles for 25, and I am legitimately stuck on 26.
Just did 43 in 9 tiles, thinking it was a very elegant and genius solution. Getting 1 star for that was depressing.
@Axxle, you can. Go to the previous level, press Ctrl+C. Go to the new level, press Ctrl+V. The solution should be inserted as a custom tile.This makes me happy.
If your friend has not played Spacechem, he needs to. It would be right up his alley.
If your friend has not played Spacechem, he needs to. It would be right up his alley.
So true, they are quite similar. There's even a somewhat long demo to try for free!
I got stuck at the final ice level. Not having stoichiometric proportions bugs me a lot.
At Xorballs, I am stuck at level 20, and the 3-star solution to 19 seems impossible to me :P
At Xorballs, I am stuck at level 20, and the 3-star solution to 19 seems impossible to me :P
At Xorballs, I am stuck at level 20, and the 3-star solution to 19 seems impossible to me :P
I remember a similar frustration back when the best score was 10 on this level. And then I came up with a 9-tile solution :)
At Xorballs, I am stuck at level 20, and the 3-star solution to 19 seems impossible to me :P
I remember a similar frustration back when the best score was 10 on this level. And then I came up with a 9-tile solution :)
I guess my 100 tile solution is well off the best then...
Man, I've just realised that when you get onto later levels, the game actually checks everything, not just the example inputs. I tried to do 48 using a clever colour changer, only to see the game test different colours to the standard yellow, which of course failed. This one is hard.
It's way away from the most elegant solution I'm sure, but I'm pretty happy with my solution to puzzle 50 (memory), just because of it's complexity. It uses all 9x9 rows and no custom tiles, and actually needs all 9x9 squares. I possible could shave a row out, but I don't think so (it's a * solution so obviously it can be improved, but you know)If you want to discuss solutions, there is an 'export solution' button in the top right. That way other people can actually click 'play' and see it work. Unfortunalety those urls end on a ] which kind of bites the url-tag on this forum. I will not be posting my memory-solution, because it's too nice a level to spoil. If you really want to know you can ask me in a PM though.
http://i48.tinypic.com/104gvw8.png - link to avoid spoilers.
http://xorballs.dskl.net/#3,memory,[0,split%20green:40B41150F607612]Here's a trick I've been using when I want to single out a specific color. I don't actually use it in my solution for this level but I do on some others. And it could improve your solution here.I can't beat 16. I'm a programmer. This makes me feel stupidThis is a tough one. I currently only have a 14 tile solution for that after I was stuck for a while on that one. Now I'm stuck at 26 again.
I've done 16 in 13 tiles, which still isn't the best. I just tried to improve 26 and felt happy about the solution, until I noticed it wasn't crediting me with victory... because I'd actually only built an 18 tile version of level 0 :-[
In my browsing I saw the below gif. And it immediately reminded me of Xorballs. How can I game I've played for like two days be affecting me this much already?Xorballs intrudes on real life?
-snip-
I've done 16 in 13 tiles, which still isn't the best. I just tried to improve 26 and felt happy about the solution, until I noticed it wasn't crediting me with victory... because I'd actually only built an 18 tile version of level 0 :-[
I did it in 11 but only got 2 stars. :-\
Does the order of the outputs matter? I think I have the correct outputs for level 37, but I'm not getting credit for it. The only differences are in ordering. For example, the expected output is "red yellow" but I get "yellow red". I never noticed it mattering before.
Mouse over the image top left.
Should get a description.
If you want to test the blue ball from the left, you can do a custom input. Just change the input color to not blue so you'll actually know which is the "real" blue one.
I haven't been able to try this until today. I haven't been able to get it to work.@Axxle, you can. Go to the previous level, press Ctrl+C. Go to the new level, press Ctrl+V. The solution should be inserted as a custom tile.This makes me happy.
I haven't been able to try this until today. I haven't been able to get it to work.@Axxle, you can. Go to the previous level, press Ctrl+C. Go to the new level, press Ctrl+V. The solution should be inserted as a custom tile.This makes me happy.
Hints for 8. Please.
Try and find a way to do the two opposite sides that doesn't intrude on the centre area, then mimic it for top and bottom.
...My brother just got a 4-star solution. On level 16. He used seven tiles.
EDIT: Here's the solution: http://xorballs.dskl.net/#3,up,[0,new:438458538540558638648]
47 what the heck...
In my browsing I saw the below gif. And it immediately reminded me of Xorballs. How can I game I've played for like two days be affecting me this much already?
(https://i.chzbgr.com/maxW500/7273094656/h456EDF46/)
http://xorballs.dskl.net/#3,double,[0,new:217228276420477]47 what the heck...
I think this is where I stop. That was a nice diversion for the weekend. 47 is weird enough that I can't just mess around and hope to get a clue. I'll keep it in the back of my mind though...
Edit: aaaaand right after I said that, I figured it out.
Right now this...Code: [Select]http://xorballs.dskl.net/#3,double,[0,new:217228276420477]
...is my solution to 17. It uses 5 tiles and I can't figure out how to do it with 4, could someone help me out?
Right now this...You have figured it out already. You just applied the method to only half of your solution.Code: [Select]http://xorballs.dskl.net/#3,double,[0,new:217228276420477]
...is my solution to 17. It uses 5 tiles and I can't figure out how to do it with 4, could someone help me out?
Right now this...You almost have it. Try to be a bit more symmetric.Code: [Select]http://xorballs.dskl.net/#3,double,[0,new:217228276420477]
...is my solution to 17. It uses 5 tiles and I can't figure out how to do it with 4, could someone help me out?
...My brother just got a 4-star solution. On level 16. He used seven tiles.
EDIT: Here's the solution (I can't get the url thing to work, just copy and paste): http://xorballs.dskl.net/#3,up,[0,new:438450538540558638648]
...My brother just got a 4-star solution. On level 16. He used seven tiles.
EDIT: Here's the solution (I can't get the url thing to work, just copy and paste): http://xorballs.dskl.net/#3,up,[0,new:438450538540558638648]
Woohoo! the first improvement on the scores by dominionstrategy.com
Congrats to your brother.
Why did he have to improve a level where I was holding the best score? ;)
47 is just an introduction level for the concept... but if that weirded you out, check 48...
...My brother just got a 4-star solution. On level 16. He used seven tiles.This is amazing. How did he get that?
EDIT: Here's the solution (I can't get the url thing to work, just copy and paste): http://xorballs.dskl.net/#3,up,[0,new:438450538540558638648]
OK, I have a new challenge. On level 1, what's the highest number of tiles you can use and still win? Only rule is each tile must be used at least once. My record is 36.
link (http://tinyurl.com/cx6nxkq)
EDIT: Got it up to 47. I'm feeling a bit dizzy. http://tinyurl.com/cnozqzu (http://tinyurl.com/cnozqzu)
...My brother just got a 4-star solution. On level 16. He used seven tiles.This is amazing. How did he get that?
EDIT: Here's the solution (I can't get the url thing to work, just copy and paste): http://xorballs.dskl.net/#3,up,[0,new:438450538540558638648]
My own effort gives me 8: from symmetry arguments I can sort of say that this requires 3 splitters and 1 "time-reversal-breaking" rotations if the solution is small enough. (My solution is equivalent for the 5 tiles at the left; notice the lower-left splitter is not necessary and can just be a yellow line.) Those 5 tiles gives the correct output except for the top input.
Adding the 2 tiles on the right to correct that (by giving the path from the right to from above and form an alternative path for itself) is... amazing.
@Kirian, I tried Spacechem recently but to be honest I found navigating the waldos too tedious to continue.
OK, I have a new challenge. On level 1, what's the highest number of tiles you can use and still win? Only rule is each tile must be used at least once. My record is 36.
link (http://tinyurl.com/cx6nxkq)
EDIT: Got it up to 47. I'm feeling a bit dizzy. http://tinyurl.com/cnozqzu (http://tinyurl.com/cnozqzu)
I've got 48 (http://tinyurl.com/bmw62ug) :)
The start is symmetrical so no headaches there.
And I'm pretty sure the end can be improved upon but not right now.
Edit: zut it's illegal. one the middle line (horizontal) the rightmost tile is unused
I feel like I'm only capable of the kludgiest of solutions. Took me 14 tiles to beat lvl 48 and 16 for 49. Question for those who have efficient solutions for lvl40+ levels - do you use a lot f custom tiles? I find I don't really bother often and not sure how helpful they really are.
Also what is your methodology. I find myself, especially for the more complicated later levels, trying to think of what I want to do at each step modularly and then do it. But it's really hard to simplify the solution and allow a lot of tiles to pull double duty that way.
I feel like I'm only capable of the kludgiest of solutions. Took me 14 tiles to beat lvl 48 and 16 for 49. Question for those who have efficient solutions for lvl40+ levels - do you use a lot f custom tiles? I find I don't really bother often and not sure how helpful they really are.
Also what is your methodology. I find myself, especially for the more complicated later levels, trying to think of what I want to do at each step modularly and then do it. But it's really hard to simplify the solution and allow a lot of tiles to pull double duty that way.
Hints for 8. Please.
I'm sure there are a bunch of solutions for 8 which use the minimum number. All of them operate on the principal that 4n-1 lefts make a right. For n = 1,2...
It's really sadistic how they give you something with a multiple tile solution, then immediately afterwards give you a new tile that would enable a single tile solution.Once you get to custom tiles that's every puzzle.
It's really sadistic how they give you something with a multiple tile solution, then immediately afterwards give you a new tile that would enable a single tile solution.
@sudgy: I'm not following you. If you can reproduce the problem, can you be more specific about what's going wrong?
Except your version of the tile took up a lot more real estate...It's really sadistic how they give you something with a multiple tile solution, then immediately afterwards give you a new tile that would enable a single tile solution.
That's the point. You just created the tile, now you can use it whenever you want.
This looks very similar to Manufactoria (http://www.kongregate.com/games/pleasingfungus/manufactoria).Actually, that's what a friend said when I explained him my idea 1.5 years ago before I had made anything.
Here's a fun mini challenge if the later ones are frustrating you.With colours you can do it with 2
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Here's a fun mini challenge if the later ones are frustrating you.With colours you can do it with 2
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Really? So any colour comes from the left, same colour leaves on the right. Any colour comes from any other direction, nothing leaves?Assume fixed colours (without it doesn't work I guess)
Really? So any colour comes from the left, same colour leaves on the right. Any colour comes from any other direction, nothing leaves?Assume fixed colours (without it doesn't work I guess)
a) 4 different colours: In this case, solution is possible with just 1 piece, the corresponding filter for colour from left in the middle field.
b) less than 4 colours: In this case, there is a unused colour, paint the left ball in this colour at its entrance, and filter for said colour in the middle field.
That's changing the puzzle and making a heck of a lot of assumptions.
Here's a fun mini challenge if the later ones are frustrating you.
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Here's a fun mini challenge if the later ones are frustrating you.
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Pretty easy.
It only takes two tiles, spinner and arrow, to make a "one way" gate. Put that along the horizontal so that pieces can't go from right to left. Then put another spinner along the vertical to block all up/down balls.
Here's a fun mini challenge if the later ones are frustrating you.
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Pretty easy.
It only takes two tiles, spinner and arrow, to make a "one way" gate. Put that along the horizontal so that pieces can't go from right to left. Then put another spinner along the vertical to block all up/down balls.
Whaaat?
Here's a fun mini challenge if the later ones are frustrating you.
Balls can enter from any direction. Balls from the left leave on the right. All other balls do not leave.
I believe the optimal solution is 3 tiles
Pretty easy.
It only takes two tiles, spinner and arrow, to make a "one way" gate. Put that along the horizontal so that pieces can't go from right to left. Then put another spinner along the vertical to block all up/down balls.
Whaaat?
I think he means like this: http://tinyurl.com/d4492sr (http://tinyurl.com/d4492sr)
That's the 3 tile solution.
Side note, those one way gates have become a staple of my later level solutions despite knowing that they probably arent part of the optimal solutions.
Now, I have a problem. I have a working solution to level 43, but when I solve it, I don't get "you solved it window" but another puzzle appears, with different input and output, and nothing gets unlocked :O
I can post solution for somebody to check or something..
Now, I have a problem. I have a working solution to level 43, but when I solve it, I don't get "you solved it window" but another puzzle appears, with different input and output, and nothing gets unlocked :O
I can post solution for somebody to check or something..
The help wasn't too clear about this, in each level you are trying to build a machine. Just because you have the correct input and output doesn't mean you built what it was asking you to. The new input and output is showing you what is wrong with it.
Some of these later levels are ridiculous... Listen to this one: "Balls come in from any direction. For the first ball nothing comes out. For each ball after the first, the previous color ball comes out on the opposite side of where the current ball came in."
Some of these later levels are ridiculous... Listen to this one: "Balls come in from any direction. For the first ball nothing comes out. For each ball after the first, the previous color ball comes out on the opposite side of where the current ball came in."
I think I'm using a lot more for 56 than you...
Some of these later levels are ridiculous... Listen to this one: "Balls come in from any direction. For the first ball nothing comes out. For each ball after the first, the previous color ball comes out on the opposite side of where the current ball came in."
Wuuut?
I already find 45 quite hard and will need a lot of time. Should sleep now htough. (didn't start it yet, no idea how to divide by 3 :p maybe by 6 is double).
OK, I have a new challenge. On level 1, what's the highest number of tiles you can use and still win? Only rule is each tile must be used at least once. My record is 36.
link (http://tinyurl.com/cx6nxkq)
EDIT: Got it up to 47. I'm feeling a bit dizzy. http://tinyurl.com/cnozqzu (http://tinyurl.com/cnozqzu)
Level 53 - I used 3/4 of the board for 52, how the hell am I going to fit THIS in ? :o
Ok, high score challenge for puzzle #8 has proved to be fairly challenging. My best so far is 43. But there's a lot of blank space out there.
43 tile solution: http://tinyurl.com/brz5pbe (http://tinyurl.com/brz5pbe)
EDIT: another 43 tile solution, but with more symmetry. Aesthetics count for something right? http://tinyurl.com/cmxlz5y (http://tinyurl.com/cmxlz5y)
Level 53 - I used 3/4 of the board for 52, how the hell am I going to fit THIS in ? :o
Level 53 - I used 3/4 of the board for 52, how the hell am I going to fit THIS in ? :o
I haven't done 53, but I think I can do it easily, if somewhat messily. Make 52 into a custom tile. Have three copies of it. Then the first outputs up for red/blue (use splitters & colour change for this) and down for yellow/green, and gets send into the second or third tile respectively, where the proper direction is determined.
It's a slightly vague solution, but if you've gotten this far, it should be very do-able.
Level 53 - I used 3/4 of the board for 52, how the hell am I going to fit THIS in ? :o
I haven't done 53, but I think I can do it easily, if somewhat messily. Make 52 into a custom tile. Have three copies of it. Then the first outputs up for red/blue (use splitters & colour change for this) and down for yellow/green, and gets send into the second or third tile respectively, where the proper direction is determined.
It's a slightly vague solution, but if you've gotten this far, it should be very do-able.
Yeah, solved it already made 4 copies of level 52, and than some sheneningans. 202 tiles, best is 27 :D
54 is a breeeze!
And can be done in much less than my messy 22 tiles. :D
No Idea how to do 57 (Recursion) as you can't actually use recursion.. (i think? when I try, state just resets).Infinite recursion is detected and causes a reset. But of course it wouldn't work anyway. Proper recursion does work. The idea is that it should in theory work for any number of balls, yes. Unfortunately I can't actually test that inside the game. But I will not accept high scores that don't work for any number of balls, even if they pass the test in the game.
It needs to work for infinite number of balls, too, right?
I've just done 56 (Storage) with 465 :DThe 8 optimization in #31 is the same as how you get from 6 to 4 in #17.
No Idea how to do 57 (Recursion) as you can't actually use recursion.. (i think? when I try, state just resets).
It needs to work for infinite number of balls, too, right?
I got 9 on stop red too.
I've just done 56 (Storage) with 465 :DThe 8 optimization in #31 is the same as how you get from 6 to 4 in #17.
No Idea how to do 57 (Recursion) as you can't actually use recursion.. (i think? when I try, state just resets).
It needs to work for infinite number of balls, too, right?
I got 9 on stop red too.
I did 53 in 72 tiles, it was about as hard as I imagined using custom tiles.
54 does indeed look easy compared to the ones that have just gone.
Mind showing me your solution? I can PM you mine if you want.
I got sick of Stef beating my high scores. So let's see him beat this: http://tinyurl.com/cgdnuxh
Also if you replace one tile you get an infinite but entertaining design: http://tinyurl.com/ctnk7e6
I got sick of Stef beating my high scores. So let's see him beat this: http://tinyurl.com/cgdnuxh
Also if you replace one tile you get an infinite but entertaining design: http://tinyurl.com/ctnk7e6
In the solution, you technically don't need that second arrow, do you?
I got sick of Stef beating my high scores. So let's see him beat this: http://tinyurl.com/cgdnuxh
Also if you replace one tile you get an infinite but entertaining design: http://tinyurl.com/ctnk7e6
In the solution, you technically don't need that second arrow, do you?
I don't need most of those tiles. That's sort of the point.
Well, it's fairly trivial to make it "necessary". For example, We can change a couple tiles to make the top ball do the bottom ball path before leaving. http://tinyurl.com/bpgegsy
I've two 4 tile solutions for 47 (init), and one of them almost solves 48 (reset init), but best I can do for 48 is 18 tiles....
yeah, that's one of them. The other one is spinner one below the middle with arrow below it, and arrow + diagonal at entranceI've two 4 tile solutions for 47 (init), and one of them almost solves 48 (reset init), but best I can do for 48 is 18 tiles....
I know how you feel. My best for 48 is 11 tiles, but the high score is 6! And it actually matters quite a bit to me, because I use that solution as a custom tile in many subsequent solutions.
What is your second 4 tile solution to 47? The one I have uses spinner, alternating spinner and two arrows, one of which could be a spinner or a diagonal just to get the ball moving up..
yeah, that's one of them. The other one is spinner one below the middle with arrow below it, and arrow + diagonal at entranceI've two 4 tile solutions for 47 (init), and one of them almost solves 48 (reset init), but best I can do for 48 is 18 tiles....
I know how you feel. My best for 48 is 11 tiles, but the high score is 6! And it actually matters quite a bit to me, because I use that solution as a custom tile in many subsequent solutions.
What is your second 4 tile solution to 47? The one I have uses spinner, alternating spinner and two arrows, one of which could be a spinner or a diagonal just to get the ball moving up..
yeah, that's one of them. The other one is spinner one below the middle with arrow below it, and arrow + diagonal at entranceI've two 4 tile solutions for 47 (init), and one of them almost solves 48 (reset init), but best I can do for 48 is 18 tiles....
I know how you feel. My best for 48 is 11 tiles, but the high score is 6! And it actually matters quite a bit to me, because I use that solution as a custom tile in many subsequent solutions.
What is your second 4 tile solution to 47? The one I have uses spinner, alternating spinner and two arrows, one of which could be a spinner or a diagonal just to get the ball moving up..
No alternator? Or no fixed spinner?
Yeah that's what I thought.
I'm not sure if this helps... hm. My trouble with the reset is that two consecutive up balls should not reset the reset. Most of my extra tiles are for preventing that case. Hm.
Yeah that's what I thought.
I'm not sure if this helps... hm. My trouble with the reset is that two consecutive up balls should not reset the reset. Most of my extra tiles are for preventing that case. Hm.
Well I dont want to give it away. But I will say the 3 star solution I got is a slight variant of the design I just linked. For an extra hint it uses 2 alternators.
My current inefficient solution for the reset uses two as well, and I know it has to... hm. Gotta take a break. Thanks!
I'm too lazy to go make nice links, so if you are curious you can copy+paste.
This is my solution to Storage:
http://xorballs.dskl.net/#3,queue1,[0,main:22723724725726132H33G34J35I41B42a243a244a245a246052D53C54F55E617629639649659],[2,switch:13014A18L24L25226445048753B56K732740835]
The main solution is really neat and ordered, I think. It's not optimal because my switch is not optimal, though even fixing that might not bring it down enough.
I got sick of Stef beating my high scores. So let's see him beat this: http://tinyurl.com/cgdnuxh
Also if you replace one tile you get an infinite but entertaining design: http://tinyurl.com/ctnk7e6
My current inefficient solution for the reset uses two as well, and I know it has to... hm. Gotta take a break. Thanks!
Why does it have to?
I'm too lazy to go make nice links, so if you are curious you can copy+paste.
This is my solution to Storage:
http://xorballs.dskl.net/#3,queue1,[0,main:22723724725726132H33G34J35I41B42a243a244a245a246052D53C54F55E617629639649659],[2,switch:13014A18L24L25226445048753B56K732740835]
The main solution is really neat and ordered, I think. It's not optimal because my switch is not optimal, though even fixing that might not bring it down enough.
Your main is better then you think. I had exactly this before getting my last improvement from 28 to 27, but that's just a silly tiny reordering. Your sub-machine is - as you say - not very optimal. Although using reset-init here as a submachine will do the trick, that is in fact too powerful. You need less functionality (no need to be able to reset an already reset machine) and thus can use a much simpler solution. I just tried replacing your custom tile by a 4-tile machine and it still worked.
My current inefficient solution for the reset uses two as well, and I know it has to... hm. Gotta take a break. Thanks!
Why does it have to?
Because otherwise how do I stop a second reset from unresetting it? :o
My current inefficient solution for the reset uses two as well, and I know it has to... hm. Gotta take a break. Thanks!
Why does it have to?
Because otherwise how do I stop a second reset from unresetting it? :o
I'm not sure what to say to that other than that I have a solution (though not minimal) with only alternator.
| <address>Yellow<value>Yellow | writes <value> on <address> |
| <address>Green | read <address> |
I've two 4 tile solutions for 47 (init), and one of them almost solves 48 (reset init), but best I can do for 48 is 18 tiles....
I know how you feel. My best for 48 is 11 tiles, but the high score is 6! And it actually matters quite a bit to me, because I use that solution as a custom tile in many subsequent solutions.
What is your second 4 tile solution to 47? The one I have uses spinner, alternating spinner and two arrows, one of which could be a spinner or a diagonal just to get the ball moving up..
My current inefficient solution for the reset uses two as well, and I know it has to... hm. Gotta take a break. Thanks!
Why does it have to?
Because otherwise how do I stop a second reset from unresetting it? :o
I'm not sure what to say to that other than that I have a solution (though not minimal) with only alternator.
My mind is blown.
It's time to really blow your mind :)
It's time to really blow your mind :)
Alright, here's my prime number generator. http://goo.gl/t6qfS
It contains Init Reset in 6 tiles so don't look at that custom tile if you want to solve it yourself.
The input is an endless stream of balls from the left. For each ball from the left one comes out on the right. The first output says whether 2 is a prime number, the second output says whether 3 is a prime number, then 4, 5, 6, etc.
Blue means prime, red means not prime.
I personally think it's not too bad to read. See if you can figure out how it works.
I don't see what you mean. Which browser? I should mention that I only ever test on Google Chrome.
The color of the star indicates how many stars you got for that level.
Do I have to make a custom tile that is simply the shell that executes all the smaller programs? How the heck does this affect the "number of tiles" that I've used?
How the heck does this affect the "number of tiles" that I've used?
How the heck does this affect the "number of tiles" that I've used?
Placing n copies of a custom tiles with m tiles in it will count as n+m tiles used.
I found the 6 tile solution to 48! :D:( I'm straight up stuck on 48... do you use the 4 tile solution to 47?
I found the 6 tile solution to 48! :D:( I'm straight up stuck on 48... do you use the 4 tile solution to 47?
ahhhhhh!!!1 rawrrrr!!! I just got with three stars the puzzle that makes 1 turn into 37. I've been playing with that one for ages, and got stuck at 17 tiles. A new idea gave me 16 tiles, with an obvious optimization to 14 tiles.
ahhhhhh!!!1 rawrrrr!!! I just got with three stars the puzzle that makes 1 turn into 37. I've been playing with that one for ages, and got stuck at 17 tiles. A new idea gave me 16 tiles, with an obvious optimization to 14 tiles.
Oh gosh. Am I sorry to say this. But this discussion made me look back at my solution for this level, and thought hey, wait a second, can't I get rid of that tile right there...
So I now have a 13 tile solution for 4 stars and we'll both lose a star pretty soon.
ahhhhhh!!!1 rawrrrr!!! I just got with three stars the puzzle that makes 1 turn into 37. I've been playing with that one for ages, and got stuck at 17 tiles. A new idea gave me 16 tiles, with an obvious optimization to 14 tiles.
Oh gosh. Am I sorry to say this. But this discussion made me look back at my solution for this level, and thought hey, wait a second, can't I get rid of that tile right there...
So I now have a 13 tile solution for 4 stars and we'll both lose a star pretty soon.
I found the 6 tile solution to 48! :D:( I'm straight up stuck on 48... do you use the 4 tile solution to 47?
There are a number of 4-tile solutions to 47 that all work on the same principal. Any should work as a starting point for 48, but some will be more efficient I think. My first solution for 48 had like 20 tiles and balls moving all over the place.
Hey a friend of mine just beat the highscore for #26. Shall I PM you her solution, David? Her name is Mckenzie.
Ahhh... got it. Amazing how I can't get below 15 for several months, and then a few days after you find 10 I find it as well.Hey a friend of mine just beat the highscore for #26. Shall I PM you her solution, David? Her name is Mckenzie.
Nice!
For now, I'm clueless. Over the past two weeks some other solutions were improved, but that was only 1 tile on levels I didn't really try to hammer down, and I found them reasonably quickly afterwards. This one however I already tried to improve many many times in the past. That got me lots of 16-tile solutions and a very few 15-tiles. And now I'm looking for 10... eek.
I'm afraid it will take a long time. *sniff*, only 2 stars for now. I like this feeling. And I don't. Well, I guess I do.
I don't think so... making it too easy to get a list of all the current bests probably spoils more then it helps. However, if there's a specific problem you want to get my solution for in order to improve upon... feel free to ask in a PM. In the past combining Davids solutions with my own has indeed lead to better ones.ahhhhhh!!!1 rawrrrr!!! I just got with three stars the puzzle that makes 1 turn into 37. I've been playing with that one for ages, and got stuck at 17 tiles. A new idea gave me 16 tiles, with an obvious optimization to 14 tiles.
Oh gosh. Am I sorry to say this. But this discussion made me look back at my solution for this level, and thought hey, wait a second, can't I get rid of that tile right there...
So I now have a 13 tile solution for 4 stars and we'll both lose a star pretty soon.
This is good; I was wondering just today if there shouldn't be some thing available, like when somebody reaches something like 165+ stars or so, a database of "current bests" (and there may be multiple methods for a single level) is available. This way people can use others' tweaks and ideas in combination and make things even better.
Apparently this guarantee that it's possible really helps. I tried faking it but that doesn't work.
Apparently this guarantee that it's possible really helps. I tried faking it but that doesn't work.
Maybe we can help. :)
Your solution is interesting. My 3-star solution doesn't use that technique but otherwise looks very similar.Stef just showed me something that looks pretty similar, just embedded a different way. Is your's similar to Stef's "alternate" solution?
Hope you understood that, trying not to give too much away :). PM me if you want to see my solution.
1
10
11
100
101
110
111
1000
... and then I realized what was happening in every column. I won't give hints unless you ask for it, but my first implementation of the new idea was 33 tiles and after that 7 more got removed by some local optimizations / better use of subtiles.Funny, it happened again. I heard McKenzie beat my lvl 55 (Storage 1) solution with a 23-tile solution (was 26), and less then an hour after that I found it too.
And this was exactly the level I tried to improve upon for the last week!
Ok now I'm going to use this improvement to beat my own score for the next level (Storage) :)
http://xorballs.dskl.net/#3,end,[76,new:44bA],[72,Turing%20Machine:02704613614bF15716623725530633734bP40041bC42bB43A45bD46450553bH54B55461766572774bQ765837845],[75,Color%20Memory:12614415430634H35G40044aV45050I54J555807827846],[74,Write%20Test:01706611B14620721022423624A25630633C34D35F400413425434444454467817846],[73,Color%20Split:34C36737C38644A46A47F48754D56757D585],[77,Tape:00604405415J21722630731aG32bI34641bG42bJ43644bF45A47648751553A55756bD57463764bO67572774bN75976bM78580581I84887bK884],[79,Turing-1:00603904806610C11713D14716F17720721aG22623724aG25526727aG28631B34937540L43B46B479515534546574635644705784827846],[87,Turing-2:24526442D44745aG46565567484B875],[88,Mini-Tape:31734640G41543644bF457537555],[31,Color%20Memory%20Direction:03704105414718622724aW26430634735540042aP46A48050554458562764aX664],[16,init%20reset:217241254306337340354400443455487537540554635648677685815844],[78,Tape-1:44B480585],[80,Tape-2:04C40B41E44648750751C585],[81,Tape-3:43C44B54E],[82,Tape-4%20%28Delay%29:00704510918422723724725726727631732aG33aG34aG35aG36aG38B40bL41242843B44B45B46B481517577585705724],[84,Tape-5:116174217221262286306325357360400419426437447463475489527535557561584805864],[85,Tape-6:045084481585],[86,Tape-7:40G],[32,BR%20Partial%20Color%20Memory:04506416aU26aS27C28435645046348866aT67D68476aU846864],[25,Partial%20Color%20Memory:04506416aU26aS27C28435636aS37D38945046348856aT57E58B66aT67F68476aU846864],[33,YG%20Partial%20Color%20Memory:04506416aU26aS27E28435645046348866aT67F68476aU846864],[83,Tape-4-1:037040086487],[30,53-3:03704005443544B456837840854],[28,53-1:486837840884],[29,53-2:037041084485]This is awesome! Something like this was supposed to be the last level but I never go to it (and lost a bit of interest when usage declined...)
I'm looking forward to trying and studying it (I haven't yet) but may not have time immediately. But assuming it's really a Turing machine you've built: congratulations for finishing the game!
http://xorballs.dskl.net/#3,end,[109,new:44bE],[76,Turing%20Machine:02707615618425726bD27436738B44bA46648bk66767bj685725774],[72,Almost%20Turing%20Machine:02704613614bF15716623725530633734bP40041bC42bB43A45bD46450553bH54B55461766572774bQ765837845],[75,Color%20Memory:12614415430634H35G40044aV45050I54J555807827846],[107,State%20Write%20Test:11714620721022424F306400413425448817846],[108,Turing%20Machine-1:037040086480585],[77,Tape:00604405415J21722630731aG32bI34641bG42bJ43644bF45A47648751553A55756bD57463764bO67572774bN75976bM78580581I84887bK884],[87,Turing-2:24526442D44745aG46565567484B875],[74,Write%20Test:01706611B14620721022423624A25630633C34D35F400413425434444454467817846],[73,Color%20Split:34C36737C38644A46A47F48754D56757D585],[79,Turing-1:00603904806610C11713D14716F17720721aG22623724aG25526727aG28631B34937540L43B46B479515534546574635644705784827846],[88,Mini-Tape:31734640G41543644bF457537555],[31,Color%20Memory%20Direction:03704105414718622724aW26430634735540042aP46A48050554458562764aX664],[16,init%20reset:217241254306337340354400443455487537540554635648677685815844],[80,Tape-2:04C40B41E44648750751C585],[78,Tape-1:44B480585],[81,Tape-3:43C44B54E],[86,Tape-7:40G],[85,Tape-6:045084481585],[84,Tape-5:116174217221262286306325357360400419426437447463475489527535557561584805864],[82,Tape-4%20%28Delay%29:00704510918422723724725726727631732aG33aG34aG35aG36aG38B40bL41242843B44B45B46B481517577585705724],[32,BR%20Partial%20Color%20Memory:04506416aU26aS27C28435645046348866aT67D68476aU846864],[25,Partial%20Color%20Memory:04506416aU26aS27C28435636aS37D38945046348856aT57E58B66aT67F68476aU846864],[33,YG%20Partial%20Color%20Memory:04506416aU26aS27E28435645046348866aT67F68476aU846864],[83,Tape-4-1:037040086487],[30,53-3:03704005443544B456837840854],[28,53-1:486837840884],[29,53-2:037041084485]http://xorballs.dskl.net/#3,end,[135,new:44cA],[134,Final:31732aq37641944c9477],[133,Color%20Fixer:03704005414J33534035444bl53754055674J837840854],[52,Recursion:32733737642aG43944aq477],[109,Turing%20with%20Rules:13618433635640J41B43044c845046747bm485517555574637665],[16,init%20reset:217241254306337340354400443455487537540554635648677685815844],[110,Interpreter:13717bt18622726by28631734641342143aV44148751752564765bn68573774c3785846854864874],[132,Mini%20Turing%20Machine:02603604B10612114015621722bh24025432533K34435736638640143044bE45048150551553454657465566767bh685837841859875],[31,Color%20Memory%20Direction:03704105414718622724aW26430634735540042aP46A48050554458562764aX664],[111,0-%3F:30731C35bp38640A41D44bq48750951E53br58560761F62bs685727737746754],[117,1-%3F:30731C35bu38640A41D44bv48750951E53bw58560761F62bx685727737746754],[122,2-%3F:30731C35bz38640A41D44c048750951E53c158560761F62c2685727737746754],[127,3-%3F:30731C35c438640A41D44c548750951E53c658560761F62c7685727737746754],[76,Turing%20Machine:02707615618425726bD27436738B44bA46648bk66767bj685725774],[105,init%20reset%20copy:217241254306337340354400442455487537540554635648677685815844],[32,BR%20Partial%20Color%20Memory:04506416aU26aS27C28435645046348866aT67D68476aU846864],[25,Partial%20Color%20Memory:04506416aU26aS27C28435636aS37D38945046348856aT57E58B66aT67F68476aU846864],[33,YG%20Partial%20Color%20Memory:04506416aU26aS27E28435645046348866aT67F68476aU846864],[113,0-0:24728634G44A46B47I48756757H58563664B73H74I837846],[114,0-1:24728634H44A46B47I48756757I58563664B73J74I837846],[115,0-2:24728634G44A46B47I48756757J58563664B73J74I837846],[116,0-3:24728634H44A46B47I48756757G58563664B73J74I837846],[118,1-0:24728634G44A46B47I48756757I58563664B73I74I837846],[119,1-1:24728634H44A46B47I48756757J58563664B73G74I837846],[120,1-2:24728634G44A46B47I48756757G58563664B73G74I837846],[121,1-3:24728634H44A46B47I48756757H58563664B73G74I837846],[123,2-0:24728634H44A46B47I48756757J58563664B73J74I837846],[124,2-1:24728634G44A46B47I48756757G58563664B73J74I837846],[125,2-2:24728634H44A46B47I48756757H58563664B73H74I837846],[126,2-3:24728634G44A46B47I48756757I58563664B73G74I837846],[128,3-0:24728634H44A46B47I48756757G58563664B73G74I837846],[129,3-1:24728634G44A46B47I48756757H58563664B73I74I837846],[130,3-2:24728634H44A46B47I48756757I58563664B73I74I837846],[131,3-3:24728634G44A46B47I48756757J58563664B73I74I837846],[75,Color%20Memory:12614415430634H35G40044aV45050I54J555807827846],[72,Almost%20Turing%20Machine:02704613614bF15716623725530633734bP40041bC42bB43A45bD46450553bH54B55461766572774bQ765837845],[108,Turing%20Machine-1:037040086480585],[107,State%20Write%20Test:11714620721022424F306400413425448817846],[30,53-3:03704005443544B456837840854],[28,53-1:486837840884],[29,53-2:037041084485],[77,Tape:00604405415J21722630731aG32bI34641bG42bJ43644bF45A47648751553A55756bD57463764bO67572774bN75976bM78580581I84887bK884],[87,Turing-2:24526442D44745aG46565567484B875],[74,Write%20Test:01706611B14620721022423624A25630633C34D35F400413425434444454467817846],[73,Color%20Split:34C36737C38644A46A47F48754D56757D585],[79,Turing-1:00603904806610C11713D14716F17720721aG22623724aG25526727aG28631B34937540L43B46B479515534546574635644705784827846],[88,Mini-Tape:31734640G41543644bF457537555],[80,Tape-2:04C40B41E44648750751C585],[78,Tape-1:44B480585],[81,Tape-3:43C44B54E],[86,Tape-7:40G],[85,Tape-6:045084481585],[84,Tape-5:116174217221262286306325357360400419426437447463475489527535557561584805864],[82,Tape-4%20%28Delay%29:00704510918422723724725726727631732aG33aG34aG35aG36aG38B40bL41242843B44B45B46B481517577585705724],[83,Tape-4-1:037040086487]{{{1,'L',1},{2,'R',3},{3,'L',3},{0,'R',3}},
{{2,'L',2},{3,'R',0},{0,'L',0},{1,'R',0}},
{{3,'R',3},{0,'L',3},{1,'R',1},{2,'L',1}},
{{0,'R',0},{1,'L',2},{2,'R',2},{3,'L',2}}}http://xorballs.dskl.net/#3,end,[135,new:44cA],[134,Final:13714015417c918431732aq37641943744bl477481585635654],[52,Recursion:32733737642aG43944aq477],[109,Turing%20with%20Rules:13618433635640J41B43044c845046747bm485517555574637665],[133,Output%20Interpreter:00602403404J05413514G15A16cC18420623425H32733bK34438C40441742bK43448851555458D65G73674J75A76cC78480583484H854],[16,init%20reset:217241254306337340354400443455487537540554635648677685815844],[132,Mini%20Turing%20Machine:02603604B10612114015621722bh24025432533K34435736638640143044bE45048150551553454657465566767bh685837841859875],[110,Interpreter:13717bt18622726by28631734641342143aV44148751752564765bn68573774c3785846854864874],[136,x10:00608410618920624928930638940448A50558B60568B70578B805844884],[82,Tape-4%20%28Delay%29:00704510918422723724725726727631732aG33aG34aG35aG36aG38B40bL41242843B44B45B46B481517577585705724],[105,init%20reset%20copy:217241254306337340354400442455487537540554635648677685815844],[76,Turing%20Machine:02707615618425726bD27436738B44bA46648bk66767bj685725774],[117,1-%3F:30731C35bu38640A41D44bv48750951E53bw58560761F62bx685727737746754],[122,2-%3F:30731C35bz38640A41D44c048750951E53c158560761F62c2685727737746754],[31,Color%20Memory%20Direction:03704105414718622724aW26430634735540042aP46A48050554458562764aX664],[111,0-%3F:30731C35bp38640A41D44bq48750951E53br58560761F62bs685727737746754],[127,3-%3F:30731C35c438640A41D44c548750951E53c658560761F62c7685727737746754],[83,Tape-4-1:037040086487],[75,Color%20Memory:12614415430634H35G40044aV45050I54J555807827846],[72,Almost%20Turing%20Machine:02704613614bF15716623725530633734bP40041bC42bB43A45bD46450553bH54B55461766572774bQ765837845],[108,Turing%20Machine-1:037040086480585],[107,State%20Write%20Test:11714620721022424F306400413425448817846],[118,1-0:24728634G44A46B47I48756757I58563664B73I74I837846],[119,1-1:24728634H44A46B47I48756757J58563664B73G74I837846],[120,1-2:24728634G44A46B47I48756757G58563664B73G74I837846],[121,1-3:24728634H44A46B47I48756757H58563664B73G74I837846],[123,2-0:24728634H44A46B47I48756757J58563664B73J74I837846],[124,2-1:24728634G44A46B47I48756757G58563664B73J74I837846],[125,2-2:24728634H44A46B47I48756757H58563664B73H74I837846],[126,2-3:24728634G44A46B47I48756757I58563664B73G74I837846],[32,BR%20Partial%20Color%20Memory:04506416aU26aS27C28435645046348866aT67D68476aU846864],[25,Partial%20Color%20Memory:04506416aU26aS27C28435636aS37D38945046348856aT57E58B66aT67F68476aU846864],[33,YG%20Partial%20Color%20Memory:04506416aU26aS27E28435645046348866aT67F68476aU846864],[113,0-0:24728634G44A46B47I48756757H58563664B73H74I837846],[114,0-1:24728634H44A46B47I48756757I58563664B73J74I837846],[115,0-2:24728634G44A46B47I48756757J58563664B73J74I837846],[116,0-3:24728634H44A46B47I48756757G58563664B73J74I837846],[128,3-0:24728634H44A46B47I48756757G58563664B73G74I837846],[129,3-1:24728634G44A46B47I48756757H58563664B73I74I837846],[130,3-2:24728634H44A46B47I48756757I58563664B73I74I837846],[131,3-3:24728634G44A46B47I48756757J58563664B73I74I837846],[77,Tape:00604405415J21722630731aG32bI34641bG42bJ43644bF45A47648751553A55756bD57463764bO67572774bN75976bM78580581I84887bK884],[87,Turing-2:24526442D44745aG46565567484B875],[74,Write%20Test:01706611B14620721022423624A25630633C34D35F400413425434444454467817846],[73,Color%20Split:34C36737C38644A46A47F48754D56757D585],[79,Turing-1:00603904806610C11713D14716F17720721aG22623724aG25526727aG28631B34937540L43B46B479515534546574635644705784827846],[88,Mini-Tape:31734640G41543644bF457537555],[30,53-3:03704005443544B456837840854],[28,53-1:486837840884],[29,53-2:037041084485],[80,Tape-2:04C40B41E44648750751C585],[78,Tape-1:44B480585],[81,Tape-3:43C44B54E],[86,Tape-7:40G],[85,Tape-6:045084481585],[84,Tape-5:116174217221262286306325357360400419426437447463475489527535557561584805864]So what you made first is a tape head, not a Turing machine.
A Turing machine also has a state machine.
What you wrote later sounds like one actual specific Turing machine, but I didn't follow it completely so it would be good if you good do a detailed write-up of that.
The holy grail would be a generic Turing machine that you can program by first inputing the state transition matrix and tape contents after which you tell it to run the program based in the input. Want to give that a shot? :)
http://xorballs.dskl.net/#3,end,[135,new:44cA],[134,Turing%20Machine:13714015417c918431732aq37641943744bl477481585635654],[133,Output%20Interpreter:00602403404J05413514G15A16cC18420623425H32733bK34438C40441742bK43448851555458D65G73674J75A76cC78480583484H854],[52,Recursion:32733737642aG43944aq477],[109,Turing%20with%20Rules:13618433635640J41B43044c845046747bm485517555574637665],[136,x10:00608410618920624928930638940448A50558B60568B70578B805844884],[82,Tape-4%20%28Delay%29:00704510918422723724725726727631732aG33aG34aG35aG36aG38B40bL41242843B44B45B46B481517577585705724],[16,init%20reset:217241254306337340354400443455487537540554635648677685815844],[132,Mini%20Turing%20Machine:02603604B10612114015621722bh24025432533K34435736638640143044bE45048150551553454657465566767bh685837841859875],[110,Interpreter:13717bt18622726by28631734641342143aV44148751752564765bn68573774c3785846854864874],[83,Tape-4-1:037040086487],[105,init%20reset%20copy:217241254306337340354400442455487537540554635648677685815844],[76,Turing%20Machine%20%28no%20instructions%29:02707615618425726bD27436738B44bA46648bk66767bj685725774],[117,1-%3F:30731C35bu38640A41D44bv48750951E53bw58560761F62bx685727737746754],[122,2-%3F:30731C35bz38640A41D44c048750951E53c158560761F62c2685727737746754],[31,Color%20Memory%20Direction:03704105414718622724aW26430634735540042aP46A48050554458562764aX664],[111,0-%3F:30731C35bp38640A41D44bq48750951E53br58560761F62bs685727737746754],[127,3-%3F:30731C35c438640A41D44c548750951E53c658560761F62c7685727737746754],[75,Color%20Memory:12614415430634H35G40044aV45050I54J555807827846],[72,Tape%20Head:02704613614bF15716623725530633734bP40041bC42bB43A45bD46450553bH54B55461766572774bQ765837845],[108,Turing%20Machine-1:037040086480585],[107,State%20Write%20Test:11714620721022424F306400413425448817846],[118,1-0:24728634G44A46B47I48756757I58563664B73I74I837846],[119,1-1:24728634H44A46B47I48756757J58563664B73G74I837846],[120,1-2:24728634G44A46B47I48756757G58563664B73G74I837846],[121,1-3:24728634H44A46B47I48756757H58563664B73G74I837846],[123,2-0:24728634H44A46B47I48756757J58563664B73J74I837846],[124,2-1:24728634G44A46B47I48756757G58563664B73J74I837846],[125,2-2:24728634H44A46B47I48756757H58563664B73H74I837846],[126,2-3:24728634G44A46B47I48756757I58563664B73G74I837846],[32,BR%20Partial%20Color%20Memory:04506416aU26aS27C28435645046348866aT67D68476aU846864],[25,Partial%20Color%20Memory:04506416aU26aS27C28435636aS37D38945046348856aT57E58B66aT67F68476aU846864],[33,YG%20Partial%20Color%20Memory:04506416aU26aS27E28435645046348866aT67F68476aU846864],[113,0-0:24728634G44A46B47I48756757H58563664B73H74I837846],[114,0-1:24728634H44A46B47I48756757I58563664B73J74I837846],[115,0-2:24728634G44A46B47I48756757J58563664B73J74I837846],[116,0-3:24728634H44A46B47I48756757G58563664B73J74I837846],[128,3-0:24728634H44A46B47I48756757G58563664B73G74I837846],[129,3-1:24728634G44A46B47I48756757H58563664B73I74I837846],[130,3-2:24728634H44A46B47I48756757I58563664B73I74I837846],[131,3-3:24728634G44A46B47I48756757J58563664B73I74I837846],[77,Tape:00604405415J21722630731aG32bI34641bG42bJ43644bF45A47648751553A55756bD57463764bO67572774bN75976bM78580581I84887bK884],[87,Turing-2:24526442D44745aG46565567484B875],[74,Write%20Test:01706611B14620721022423624A25630633C34D35F400413425434444454467817846],[73,Color%20Split:34C36737C38644A46A47F48754D56757D585],[79,Turing-1:00603904806610C11713D14716F17720721aG22623724aG25526727aG28631B34937540L43B46B479515534546574635644705784827846],[88,Mini-Tape:31734640G41543644bF457537555],[30,53-3:03704005443544B456837840854],[28,53-1:486837840884],[29,53-2:037041084485],[80,Tape-2:04C40B41E44648750751C585],[78,Tape-1:44B480585],[81,Tape-3:43C44B54E],[86,Tape-7:40G],[85,Tape-6:045084481585],[84,Tape-5:116174217221262286306325357360400419426437447463475489527535557561584805864]Does the transition matrix implement any particular function?
{{{1,'L',1},{2,'R',3},{3,'L',3},{0,'R',3}},
{{2,'L',2},{3,'R',0},{0,'L',0},{1,'R',0}},
{{3,'R',3},{0,'L',3},{1,'R',1},{2,'L',1}},
{{0,'R',0},{1,'L',2},{2,'R',2},{3,'L',2}}}The state machine has at most 4 states, correct?
Does the transition matrix implement any particular function?
Right now it does.Code: [Select]{{{1,'L',1},{2,'R',3},{3,'L',3},{0,'R',3}},
{{2,'L',2},{3,'R',0},{0,'L',0},{1,'R',0}},
{{3,'R',3},{0,'L',3},{1,'R',1},{2,'L',1}},
{{0,'R',0},{1,'L',2},{2,'R',2},{3,'L',2}}}
It's this. The state is the row, the color is the column. Each triple is {new color, direction to move the tape, new state}. It can easily be changed to whatever you want, however.
Does the transition matrix implement any particular function?
Right now it does.Code: [Select]{{{1,'L',1},{2,'R',3},{3,'L',3},{0,'R',3}},
{{2,'L',2},{3,'R',0},{0,'L',0},{1,'R',0}},
{{3,'R',3},{0,'L',3},{1,'R',1},{2,'L',1}},
{{0,'R',0},{1,'L',2},{2,'R',2},{3,'L',2}}}
It's this. The state is the row, the color is the column. Each triple is {new color, direction to move the tape, new state}. It can easily be changed to whatever you want, however.
I understand. But that's not very easy to read. By "particular function" I meant something that's easy to explain like "addition". Is there anything special about this particular matrix?