scratchisthebest wrote:

Here's a 7-wide9-wide because I'm a dum dum version: https://scratch.mit.edu/projects/95249382

“Look mom! I made a thing!”

(why does cubeupload's page have to be down everytime at nighttime)
EDIT:
“Mom! I made another thing!”

-Io- wrote:

scratchisthebest wrote:

Here's a 7-wide9-wide because I'm a dum dum version: https://scratch.mit.edu/projects/95249382

“Look mom! I made a thing!”
http://i66.tinypic.com/2j4adfs.png
(why does cubeupload's page have to be down everytime at nighttime)

I'm finding it more fun to make pretty pictures than to solve the puzzle

http://puu.sh/mHmHE.png
http://puu.sh/mHmMd.png
http://puu.sh/mHmTR.png

ed: Oh come on now http://puu.sh/mHmYt.png

scratchisthebest wrote:

-Io- wrote:

scratchisthebest wrote:

Here's a 7-wide9-wide because I'm a dum dum version: https://scratch.mit.edu/projects/95249382

“Look mom! I made a thing!”
http://i66.tinypic.com/2j4adfs.png
(why does cubeupload's page have to be down everytime at nighttime)

I'm finding it more fun to make pretty pictures than to solve the puzzle

http://puu.sh/mHmHE.png
http://puu.sh/mHmMd.png
http://puu.sh/mHmTR.png

ed: Oh come on now http://puu.sh/mHmYt.png

“Mom! Along with the other two i made a third one!”

EDIT: Woah…

Oh, nice! I might try to find the best solution for this as well.

anyone want to make a variable width version?

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

wizzwizz7 wrote:

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

Oops! I thought I had already posted it.

Code is here: https://jsfiddle.net/PullJosh/h9oja4jp/6/

Basically it just finds every possible combination of moves (anywhere from 3 to 19 clicks) and then tests them all to see if they work. If they do, it logs the moves to the console.

Very hacky, but it works. Unfortunately, on the larger board, everything just crashes.
(Here's the code for the larger version.)

WooHooBoy wrote:

anyone want to make a variable width version?

Sure! https://scratch.mit.edu/projects/95279740/

Looks like 5 and 9 are the only widths that are very interesting. The rest are pretty easy.

http://prntscr.com/9u7r16

I am super player

PullJosh wrote:

wizzwizz7 wrote:

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

Oops! I thought I had already posted it.

Code is here: https://jsfiddle.net/PullJosh/h9oja4jp/6/

Basically it just finds every possible combination of moves (anywhere from 3 to 19 clicks) and then tests them all to see if they work. If they do, it logs the moves to the console.

Very hacky, but it works. Unfortunately, on the larger board, everything just crashes.
(Here's the code for the larger version.)

Oh. So not a mathematical way of doing it? (there might not be one)

WooHooBoy wrote:

http://prntscr.com/9u7r16

I am super player

???

wizzwizz7 wrote:

PullJosh wrote:

wizzwizz7 wrote:

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

Oops! I thought I had already posted it.

Code is here: https://jsfiddle.net/PullJosh/h9oja4jp/6/

Basically it just finds every possible combination of moves (anywhere from 3 to 19 clicks) and then tests them all to see if they work. If they do, it logs the moves to the console.

Very hacky, but it works. Unfortunately, on the larger board, everything just crashes.
(Here's the code for the larger version.)

Oh. So not a mathematical way of doing it? (there might not be one)

Of course there is. We just don't know what yet :p

WooHooBoy wrote:

anyone want to make a variable width version?

I'm making one in python right now.

WooHooBoy wrote:

wizzwizz7 wrote:

PullJosh wrote:

wizzwizz7 wrote:

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

Oops! I thought I had already posted it.

Code is here: https://jsfiddle.net/PullJosh/h9oja4jp/6/

Basically it just finds every possible combination of moves (anywhere from 3 to 19 clicks) and then tests them all to see if they work. If they do, it logs the moves to the console.

Very hacky, but it works. Unfortunately, on the larger board, everything just crashes.
(Here's the code for the larger version.)

Oh. So not a mathematical way of doing it? (there might not be one)

Of course there is. We just don't know what yet :p

I don't know. It could be a bit like the postman problem - how could the postman do his round (on a specific map) travelling the least? - where there is no mathematical way to solve it, just brute force.

And there's a proof written for that, but probably not fun to read

I'm 100% sure I've played a game either extremely similar to or just like it, but I can't remember the name… :L

wizzwizz7 wrote:

WooHooBoy wrote:

wizzwizz7 wrote:

PullJosh wrote:

wizzwizz7 wrote:

PullJosh, how does the code and maths work for the computer solving it? Please can you post your code?

Oops! I thought I had already posted it.

Code is here: https://jsfiddle.net/PullJosh/h9oja4jp/6/

Basically it just finds every possible combination of moves (anywhere from 3 to 19 clicks) and then tests them all to see if they work. If they do, it logs the moves to the console.

Very hacky, but it works. Unfortunately, on the larger board, everything just crashes.
(Here's the code for the larger version.)

Oh. So not a mathematical way of doing it? (there might not be one)

Of course there is. We just don't know what yet :p

I don't know. It could be a bit like the postman problem - how could the postman do his round (on a specific map) travelling the least? - where there is no mathematical way to solve it, just brute force.

That's actually called the traveling salesman problem, and it is NP-Complete, which means that there might be an efficient way to solve it, but nobody has been able to figure out one.
An example of a problem that is truly unsolvable (even with brute forcing) would be Post's Correspondence problem

Firedrake969 wrote:

And there's a proof written for that, but probably not fun to read

I'm 100% sure I've played a game either extremely similar to or just like it, but I can't remember the name… :L

Nope, I enjoy reading that sort of stuff. POST IT! Also, it's called ‘Lights Out’.

Firedrake969 wrote:

http://www.csd.uoc.gr/~hy583/papers/ch11.pdf

All that Times New Roman is getting on my nerves.