When does this thing end?
It gets complicated quick....
Yep, just beat level 5, but I gotta stop there, for now
Cool game, though.
I wimped out on level 3 but I am really tired so maybe tomorrow eh?
Interesting, would anyone like to take a shot at explaining the mathematical concepts behind this game? It reminds me of the Bridges of Konigsberg problem. From my limited experience with the game, it seems that the secret is to place the nodes having the most edges in the center, while the nodes having only two or three edges can be arranged around the perimeter.
jma, that is what I was doing.
The Bridges of Konigsberg is a graph theory problem, and this game certainly has to do with graphs (a graph is just a thing with "nodes" as you call them, and edges connecting nodes in some manner). If I recall correctly, a planar graph is any graph that can be drawn in the plane such that no two edges cross each other. If you have 4 nodes forming a square, and edges connecting every pair of points, then you'll get a square with an X in the middle. But you can take one of the diagonals and have that edge go from one corner outside and around the square to the opposite corner, so it's a planar graph.
So in this game, you show that each of the graphs are planar. I think in the Bridges problem, you are trying to find a special kind of circuit (Euler Circuit?). Whether a graph is planar and whether it contains a Euler Circuit may or may not be directly related (i.e. I don't know if there's a theorem that says whether a planar graph has a circuit, or something like that) but both are indirectly related as they both have to do with graph theory. Most of the above is based on sketchy knowledge from over a year ago, so I would recommend looking up some of these things:
Graph and Graph theory
Bridges of Konigsberg
on a site like Mathworld.com.
Thanks AKG, that is just the sort of info I was looking for.
In case anyone is curious, here's what level 8 looks like. I'm out.
I believe a eular circuit is where each "node"/vertices is crossed only once.
I could well be wrong but unless that "mass" of lines has only 2 vertices with an odd number of arcs then there are not eular on the other hand if they do only have the two then they could very well be eular.
NO I did not get that far, some other clever person.
I stopped after completing level 5. To get to that stage took me about 10 minutes.
If I knew it ended at some stage, I might be motivated to continue...
Nice game, though.
Pff, I was about to post a screenshot of level 8 completed, not anymore Nice work Kia!!!
i finished level 5 in 5min...now i'm sick to my stomach can you save the game?!? i missed all the gui buttons cuz i quit X. My only tactic is to take all the degrees of 2 and move them as close the edge that they adjacent to...wsih you could move groups...
ok i decided to play again level 6 took me not to long maybe 5-7 min but level 7 i'm well past 15 minARG .,..ok is that timer accurate cuz it says it only took me12min. 9 min on level 9
NOOOOO...i finished level 10 and it tells me that a flashscript is running really slow and to abot...then it stalled the game!!!!!.
That happened to me, too. Click 'No' (as in, no, don't abort the script) and wait. You might have to click 'No' a few times, but it will finish eventually.
It's true, I have no life ...
Hell no, that is crazy...
are you using trial and error to figure out what works or did you work out an easier way?
When I was a kid, I spent a lot of time drawing mazes on big sheets of paper, so I guess I developed an ingrained sense of how pathways fit together.
There is a method, it's hard to explain exactly, but in general:
When you click on each node, you will notice that the other nodes it is connected to are highlighted in red. I begin by going around the circle, clicking on each node one by one, and moving it to a point that is roughly equidistant between the other highlighted nodes. That way, all the nodes that are connected to each other are grouped together in the same general area.
Then, I choose one small area on the perimeter and untangle it. Nodes with two or three edges always go to the outside, four-edge nodes go to the center. Move the untangled piece into a corner, as far away from the other nodes as possible.
From there, as cliched as it sounds, it is simply a matter of taking one node at a time, and moving it from the tangled area to the untangled area. There is only one place that each new node can go, so that it is not crossing any of the edges in the untangled grouping.
Every now and then, if you get stuck, go back to the trick of dragging each tangled node to a position that is roughly equidistant between the other connected nodes. That will get you back on the right track.
In the screenshot that I posted, the original untangled area was in the upper right corner. You can see that, as I worked from the upper right outward, the lines connecting the nodes got longer and longer, as I dragged them into place from the lower left to the untangled area.
I'm currently on six, and scared, you should see it! :surprised
I'm worried that the notes say the algorithm doesn't always generate a solvable puzzle.
Now THAT would be very frustrating!
Separate names with a comma.