The Hands of Time Solver

#1DeMoNiCxMaNPosted 2/4/2012 1:56:59 PM
I have created a hands of time solver. I haven't completely finished the program (and probably never will) but it works.

So far its worked for me so hopefully it works for u guys.

http://www.mediafire.com/?wzxdd3h1o04hw12

Pretty sure it will come in handy for the hands of time with 13 switches.
#2maliceinaholePosted 2/4/2012 3:30:39 PM
Bump!
Thanks!!!!!!!!!!!
#3Twizted_JayPosted 2/4/2012 3:45:40 PM
Wow thanks a bunch HELPS so much

BUMP
#4TidusWakkaAuronPosted 2/4/2012 3:53:19 PM
2 New User Accounts, You've named it as "FFXII-2".
---
Hahahaha, Don't let the door hit you where the good lord split ya hunny !!! HAHAHAHA!
#5dirwulfPosted 2/4/2012 4:52:37 PM
Its not working for me on 11. I keep getting invalid rows. Yes, I am starting north and going clockwise.
#6dirwulfPosted 2/4/2012 4:57:39 PM
Here is an example

4 top north
3
1
3
5
3
4
2
4
2
1
#7dirwulfPosted 2/4/2012 6:36:31 PM
I found one that actually works and you don't have to download.

http://nyusuke.com/game/ff13/ff13-2puzzle.html
#8HaljaPosted 2/4/2012 6:38:07 PM
CURSES!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

WHERE WAS THIS WHEN I WAS DOING ALL OF OERBA!!!!!
---
Would anyone like some pound cake?
http://www.youtube.com/watch?v=SL_x1rRg7mM
#9DeMoNiCxMaN(Topic Creator)Posted 2/4/2012 6:44:28 PM
dirwulf posted...
Its not working for me on 11. I keep getting invalid rows. Yes, I am starting north and going clockwise.

Hey guys,

sorry i went to sleep.... was doing this at 12:00am when I too was stuck at doing the stupid puzzle..... So i was abit careless with the odd switches....

Just woken up now (4 hours of sleep) and back to ff13-2

heres the new version which solves 5,7,9,11,13 switches

http://www.mediafire.com/?9pa44adl03sb6k8
#10DeMoNiCxMaN(Topic Creator)Posted 2/4/2012 6:51:56 PM
Yep,

I too was going for web application..... I don't have a server/host so couldn't do it as a web application like that japanese one.

Not sure how they did it but here's how i basically did it for those that are interested.

FOR each starting point in the puzzle DO
----Build all possible paths
----IF the height/depth of the path is equal to the number of switches THEN
--------GET any path that has the depth of the number of switches
-----ENDIF
ENDFOR

the paths I built using a binary tree