This is an archived, read-only copy of the United-TI subforum , including posts and topic from May 2003 to April 2012. If you would like to discuss any of the topics in this forum, you can visit Cemetech's
Your Projects subforum. Some of these topics may also be directly-linked to active Cemetech topics. If you are a Cemetech member with a linked United-TI account, you can link United-TI topics here with your current Cemetech topics.
Project Releases =>
Your Projects
| Author |
Message |
|
ticalcnoah
Member
Joined: 28 Oct 2007
Posts: 153
|
|
| Back to top |
|
|
GloryMXE7
Puzzleman 3000
Active Member
Joined: 02 Nov 2008
Posts: 604
|
 Posted: 12 Dec 2008 02:34:04 pm Post subject: |
|
|
| cool so what is the total for each row column and diagonalor or does that vary |
|
| Back to top |
|
|
bananaman
Indestructible
Calc Guru
Joined: 12 Sep 2005
Posts: 1124
|
| Posted: 12 Dec 2008 03:20:16 pm Post subject: |
|
|
I believe that the goal is to slide the pieces around until you reach 1,2,3,4,5,...
Typically the puzzle has some sort of picture on the pieces and you need to slide the pieces around to make the picture appear. |
|
| Back to top |
|
|
GloryMXE7
Puzzleman 3000
Active Member
Joined: 02 Nov 2008
Posts: 604
|
| Posted: 12 Dec 2008 04:16:40 pm Post subject: |
|
|
| no this is diferent All rows columns and diagonals must equal a certain value |
|
| Back to top |
|
|
DarkerLine
ceci n'est pas une |
Super Elite (Last Title)
Joined: 04 Nov 2003
Posts: 8328
|
| Posted: 12 Dec 2008 04:46:22 pm Post subject: |
|
|
| Actually, the object of the game is to successfully read the readme file. |
|
| Back to top |
|
|
GloryMXE7
Puzzleman 3000
Active Member
Joined: 02 Nov 2008
Posts: 604
|
| Posted: 12 Dec 2008 06:02:50 pm Post subject: |
|
|
| nvm i was wrong i got 15square mixed up with magic square |
|
| Back to top |
|
|
Ed H
Member
Joined: 30 Nov 2007
Posts: 138
|
| Posted: 13 Dec 2008 03:13:02 pm Post subject: |
|
|
I'm not sure if your shuffle algorithm always produces valid positions. What I believe you're doing is adding -1, 0, or 1 randomly to the row and column indexes of the empty square, and then swapping the empty square with the square at the new coordinates. That doesn't always give you legal moves, though -- swapping the empty square diagonally is impossible without changing any other pieces. If the program adds a 1 and a 1 to the row and column of the empty square, then it's doing a diagonal swap, and changing the solvability of the puzzle.
One fix you could do is to only add 1 or -1 to a randomly chosen axis, either the row or the column. This guarantees a valid move every swap.
Another option is to generate a completely random permutation of all the squares, and then determine if it is solvable using parity. If it is unsolvable, then do an illegal swap, which makes it solvable.
An example of how to do this for the 15 puzzle is shown in this thread. |
|
| Back to top |
|
|
ticalcnoah
Member
Joined: 28 Oct 2007
Posts: 153
|
| Posted: 13 Dec 2008 03:17:29 pm Post subject: |
|
|
| I've actually been looking at that thread for a improvement on my shuffling but the 1=sum(abs(L3-{A,B makes sure there can't be diagonal shuffles. |
|
| Back to top |
|
|
Ed H
Member
Joined: 30 Nov 2007
Posts: 138
|
| Posted: 13 Dec 2008 03:42:31 pm Post subject: |
|
|
| Ah, thank you for correcting me. I wasn't sure what that line was for. |
|
| Back to top |
|
|
|
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.
»
Go to Registration page
