Sierpinski Network

[Julian]

Wow, these are a huge pain on a trackpad.

Hey, I'm on a trackpad.

 

[Meep]

Sierpinski is spelled wrong on the page

I just fixed it.

 

[StachuK1992]

Let's organize strategies and such better. I've been into this for a bit now, and it seems really interesting.

-clicking every node will totally invert the network
-for an optimal solution, no node should be clicked twice

 

[qqwref]

Here's a very interesting one, IMO. Recall my method, where I start by using the corners to solve the non-corner pieces into groups of three of the same color. There are always exactly two ways to do this, and they are inverses of each other (that is, every corner is in exactly one of these two solutions). However, for n odd, one of these ways will give you parity when you try to finish the puzzle, and the other will not.

Also, if you don't make mistakes, finding one of these solutions can always be done optimally by a human. It's simply a matter of expanding out from the first node you choose to click or not click, and checking which corners must be clicked and which cannot be clicked to make a consistent solution.

 

[y235]

-clicking every node will totally invert the network
-for an optimal solution, no node should be clicked twice

I said that on 1st page.

 

[qqwref]

Hey Meep, would you be willing to add some kind of averaging routines to the Sierpinski puzzles? It'd be a lot easier than having to enter all my times into another timer. I basically use the same ones for my sims; you can pretty much copy over the startTimer, pretty, updateTimer, getAvg, and clearTimes functions (and the necessary variables) with slight modifications for where you want to display the averages. You can see how to call these functions from the rest of the code of, say, qCube. I'm thinking the times should be cleared when you change the puzzle size or reset a scrambled puzzle.

 

[qqwref]

Bump with times Sorry to hurt everyone's chances at being better than me.

n=2:
0.21 single (2 clicks)
0.99 avg5: 2.08, (2.16), 0.47, (0.27), 0.43
1.23 avg12: 0.99, 1.58, 2.26, 0.47, 1.04, 0.77, (2.90), 2.08, 2.16, 0.47, (0.27), 0.43
1.63 avg100:

n=3:
4.00 single
5.48 avg5: 5.70, 4.92, (7.53), (4.41), 5.83
6.41 avg12: 5.85, 6.00, (7.66), 7.37, 6.59, 5.70, 4.92, 7.53, (4.41), 5.83, 7.26, 7.04
7.51 avg100

n=4:
20.62 single
22.79 avg5: 22.96, 24.10, (26.74), 21.32, (20.95)
24.20 avg12: 22.21, 22.96, 24.10, 26.74, 21.32, (20.95), 26.65, 24.66, 25.04, 26.19, (27.09), 22.08

n=5:
1:10.12 single
1:21.23 avg5: 1:23.63, 1:22.18, 1:17.89, (1:10.12), (2:35.95)
1:58.46 avg12: 1:23.63, 1:22.18, 1:17.89, (1:10.12), 2:35.95, 2:38.53, 1:16.49, 1:16.00, 2:37.90, 2:38.64, (2:43.64), 2:37.38

n=6:
4:48.37 single

 

[Meep]

Hey Meep, would you be willing to add some kind of averaging routines to the Sierpinski puzzles? It'd be a lot easier than having to enter all my times into another timer. I basically use the same ones for my sims; you can pretty much copy over the startTimer, pretty, updateTimer, getAvg, and clearTimes functions (and the necessary variables) with slight modifications for where you want to display the averages. You can see how to call these functions from the rest of the code of, say, qCube. I'm thinking the times should be cleared when you change the puzzle size or reset a scrambled puzzle.

Ah, I missed this post. I'll think on it and see if I can do it during my breaks at work (That's when I'm most productive/when I made this game in the first place).

 

[qqwref]

Funny, that's basically when I made qqtimer/qCube too