|
| View previous topic :: View next topic |
| Author |
Message |
| Sldub
| | Joined: 02 Nov 2005 | | Posts: 1 | | : | | Location: Amsterdam |
Items |
|
 Posted: Wed Nov 02, 2005 12:55 pm Post subject: Sudoku - Can be solved by anyone. No need to write programs. |
 |
|
To Solve a sudoku the best and simple method is prepare the sudoku chart in excel and in the empty cells just write down 123456789. Then consider each cell and stike out the number which is there vertically or horizontally and in a sub block. This way the numbers gets striked off and you get the remaining numbers possible in that cell. This way it diminishes the numbers wrtiiten in the cell. As for example 123456789 is written in a cell. Horizontally other numbers present are 4,2,8 and vertically 3, 9,1 and while in the block (sub block ) you have numbers 3,2,4 . So you are left with 5 6 and 7 in that cell. Continue doing the same with other cells. When you are complete doing with all the cells you start getting 1 numbers from a bunch of 9 i,.e from 123456789 may be 5 is left and thus 5 is the answer for that cell.
It takes about 20 minutes to do or sometimes even less that 10 minutes.
Someway should be there so that even a lay man can solve this sort of program. Programs are not always the solution.
Thanks |
|
| Back to top |
|
 |
| soduko
| | Joined: 10 Oct 2005 | | Posts: 50 | | : | |
Items |
|
| Posted: Wed Nov 02, 2005 3:19 pm Post subject: |
|
|
Try many of the puzzles that are discussed elsewhere in this forum...
Be Amazed, or shocked |
|
| Back to top |
|
|
| Simes
 | | Joined: 08 Apr 2005 | | Posts: 71 | | : | | Location: North Yorkshire, UK |
Items |
|
|
| Back to top |
|
|
| nj3h
| | Joined: 29 Jul 2005 | | Posts: 9 | | : | | Location: Virginia - USA |
Items |
|
| Posted: Wed Nov 02, 2005 5:34 pm Post subject: |
|
|
Simon,
Please send my money back. I don't need your program any longer.
Yours is an excellent program, but it is now obviously redundant.
Well, I guess I'll just keep it a little longer. Maybe next week you can send the refund.
Oh brother. |
|
| Back to top |
|
|
| Lummox JR
| | Joined: 07 Sep 2005 | | Posts: 202 | | : | |
Items |
|
| Posted: Thu Nov 03, 2005 1:10 am Post subject: |
|
|
Excellent, Sldub. I look forward to seeing your solution to this one:
| Code: | . 5 2|. . 6|8 . .
. . .|. . 7|. 2 .
. . .|. . .|6 . .
-----------------
. . 4|8 . .|9 . .
2 . .|4 1 .|. . .
. . 1|. . .|. . 8
-----------------
. . 6|1 . .|3 8 .
. . .|. 9 .|. . 6
3 . .|6 . .|1 . 9 |
|
|
| Back to top |
|
|
| Haelian
| | Joined: 03 Nov 2005 | | Posts: 3 | | : | | Location: MA |
Items |
|
| Posted: Thu Nov 03, 2005 2:44 am Post subject: |
|
|
| Code: | 1 5 2 9 4 6 8 3 7
9 6 3 5 8 7 4 2 1
8 4 7 2 3 1 6 9 5
5 7 4 8 6 3 9 1 2
2 8 9 4 1 5 7 6 3
6 3 1 7 2 9 5 4 8
7 9 6 1 5 2 3 8 4
4 1 5 3 9 8 2 7 6
3 2 8 6 7 4 1 5 9
It took 386379 passes through the puzzle to solve it and 3206667 different numbers were tried in the 81 different slots.
|
ya, i cheated and used a program i made in a couple weeks, but as you can see it did a number on it. (took 3-4 minutes i think)
i didn't make the program to be able to solve puzzles easily, i took it as a challenge to program something for fun. i wouldn't know why anyone would make one otherwise, it's not a very useful program really.
P.S. see you on BYOND Lummox 
Edit: ran it again using the same puzzle, did it in about half the time (2 minutes 19 seconds). my program isn't very efficient, whenever it gets to an impossible fill (meaning it made a mistake along the way) it picks a number between 1 and 9 randomly to put in and sets all of the same numbers within the horizontal/vertical/square to 0 (which it then fills in during the next pass). |
|
| Back to top |
|
|
| Bob Hanson
| | Joined: 05 Oct 2005 | | Posts: 187 | | : | | Location: St. Olaf College |
Items |
|
| Posted: Thu Nov 03, 2005 4:42 am Post subject: |
|
|
Oooh, yes, that's a GOOD one! Sudoku Assistant http://www.stolaf.edu/people/hansonr/sudoku took 59 steps to solve this one. Not the longest I've seen, but check out the logic trail: (Nick70 "reverse" logic here):
| Code: |
Step 39
a: The hypothesis is this: Chain 8(0) can be eliminated.
n: Two values in Row 3 for #4, either false, will force A to be TRUE
|---c1--|---c2--|---c3--||---c4--|---c5--|---c6--||---c7--|---c8--|---c9--
-----------------------------------------------------------------------------
r1 | 17 | 5 | 2 || 39 | 4 | 6 || 8 | 39 | 17
| mU | | || | | || | | Mm
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r2 | 14689 | 146 | 389 || 359 | 358 | 7 || 45 | 2 | 145
| SSqFS | NnQ | F || B | FBe | || Aa | | mNB
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r3 | 4789 | 4789 | 3789 || 2 | 358 | 1 || 6 | 39 | 457
| nUnK | LeLX | CB || | DbD | || | | nBL
===========================||=======================||=======================
r4 | 567 | 367 | 4 || 8 | 356 | 35 || 9 | 1 | 2
| OQq | uQT | || | WDq | Ln || | |
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r5 | 2 | 689 | 589 || 4 | 1 | 59 || 7 | 56 | 3
| | pQQ | MzX || | | Oz || | oP |
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r6 | 569 | 369 | 1 || 7 | 236 | 239 || 45 | 456 | 8
| oQX | VQw | || | XwQ | yLX || aA | AQp |
===========================||=======================||=======================
r7 | 4579 | 2479 | 6 || 1 | 257 | 245 || 3 | 8 | 45
| KHUj | gICX | || | GDe | ZzH || | | Gb
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r8 | 14578 | 148 | 578 || 35 | 9 | 3458 || 2 | 457 | 6
| NLLUn | L | LbB || Kk | | kLLL || | eHC |
---+-------+-------+-------||-------+-------+-------||-------+-------+-------
r9 | 3 | 2478 | 578 || 6 | 257 | 2458 || 1 | 457 | 9
| | HnC | lMM || | eDE | Z L || | EHd |
-----------------------------------------------------------------------------
Logical analysis: Chain 8(0)
a: The hypothesis is this: Chain 8(0) can be eliminated.
a: setting r2c7#5 FALSE chain 8 parity 0
a: setting r6c7#4 FALSE chain 8 parity 0
A: The hypothesis is proven if chain 8(1) is proven to be TRUE
A: setting r2c7#4 TRUE chain 8 parity 1
A: setting r6c8#4 TRUE chain 8 parity 1
A: setting r6c7#5 TRUE chain 8 parity 1
B: The hypothesis is proven if any of the following weakly associated nodes 8(0) are TRUE:
B: setting r2c4#5 TRUE
B: setting r2c5#5 TRUE
B: setting r2c9#5 TRUE
B: setting r3c9#5 TRUE
b: 3x3 block 2 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
b: column 9 is nearly all TRUE for #7, so a FALSE there forces one of the others TRUE
b: The hypothesis is proven if any of the following are forced FALSE:
b: setting r3c5#5 FALSE
b: setting r7c9#5 FALSE
C: The hypothesis is linked by r3c5#5 chain 10(1)
c: The hypothesis is proven if chain 10(1) is proven to be FALSE
D: The hypothesis is proven if any of the following weakly associated nodes 10(1) are TRUE:
D: setting r3c5#3 TRUE
D: setting r4c5#5 TRUE
D: setting r7c5#5 TRUE
D: setting r3c5#8 TRUE
D: setting r9c5#5 TRUE
E: The hypothesis is linked by 10(1)/9(0)
e: The hypothesis is proven if chain 9(1) is proven to be FALSE
e: setting r2c5#8 FALSE chain 9 parity 1
F: The hypothesis is proven if any of the following weakly associated nodes 9(1) are TRUE:
F: setting r2c1#8 TRUE
F: setting r2c3#8 TRUE
F: setting r2c5#3 TRUE
G: The hypothesis is linked by r7c9#5 chain 22(0)
G: setting r7c9#4 TRUE chain 22 parity 1
g: The hypothesis is proven if chain 22(0) is proven to be FALSE
H: The hypothesis is proven if any of the following weakly associated nodes 22(0) are TRUE:
H: setting r7c1#5 TRUE
H: setting r8c8#5 TRUE
H: setting r7c6#5 TRUE
H: setting r9c8#5 TRUE
K: The hypothesis is linked by 22(0)/11(1)
K: setting r8c4#3 TRUE chain 11 parity 1
k: The hypothesis is proven if chain 11(0) is proven to be FALSE
k: setting r8c4#5 FALSE chain 11 parity 0
k: setting r8c6#3 FALSE chain 11 parity 0
L: The hypothesis is proven if any of the following weakly associated nodes 11(0) are TRUE:
L: setting r8c1#5 TRUE
L: setting r8c3#5 TRUE
L: setting r8c6#5 TRUE
L: setting r9c6#5 TRUE
L: setting r4c6#3 TRUE
L: setting r8c6#4 TRUE
L: setting r6c6#3 TRUE
L: setting r8c6#8 TRUE
l: 3x3 block 7 is nearly all TRUE for #9, so a FALSE there forces one of the others TRUE
l: row 9 is nearly all TRUE for #3, so a FALSE there forces one of the others TRUE
l: The hypothesis is proven if any of the following are forced FALSE:
l: setting r9c3#5 FALSE
M: The hypothesis is proven if any of the following nodes are TRUE:
M: setting r5c3#5 TRUE
M: setting r9c3#7 TRUE
M: setting r9c3#8 TRUE
N: The hypothesis is linked by 11(0)/12(1)
n: The hypothesis is proven if chain 12(0) is proven to be FALSE
n: setting r4c6#5 FALSE chain 12 parity 0
O: The hypothesis is proven if any of the following weakly associated nodes 12(0) are TRUE:
O: setting r4c1#5 TRUE
O: setting r5c6#5 TRUE
o: column 1 is nearly all TRUE for #6, so a FALSE there forces one of the others TRUE
o: 3x3 block 4 is nearly all TRUE for #7, so a FALSE there forces one of the others TRUE
o: row 5 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
o: The hypothesis is proven if any of the following are forced FALSE:
o: setting r6c1#5 FALSE
o: setting r5c8#5 FALSE
P: The hypothesis is linked by r5c8#5 chain 16(1)
P: setting r5c8#6 TRUE chain 16 parity 0
p: The hypothesis is proven if chain 16(1) is proven to be FALSE
p: setting r5c2#6 FALSE chain 16 parity 1
p: setting r6c8#6 FALSE chain 16 parity 1
Q: The hypothesis is proven if any of the following weakly associated nodes 16(1) are TRUE:
Q: setting r4c1#6 TRUE
Q: setting r2c2#6 TRUE
Q: setting r4c2#6 TRUE
Q: setting r6c2#6 TRUE
Q: setting r6c1#6 TRUE
Q: setting r5c2#8 TRUE
Q: setting r5c2#9 TRUE
Q: setting r6c8#5 TRUE
Q: setting r6c5#6 TRUE
q: column 1 is nearly all TRUE for #2, so a FALSE there forces one of the others TRUE
q: cell r4c1 is nearly all TRUE for #7, so a FALSE there forces one of the others TRUE
q: row 4 is nearly all TRUE for #5, so a FALSE there forces one of the others TRUE
q: The hypothesis is proven if any of the following are forced FALSE:
q: setting r2c1#6 FALSE
q: setting r4c1#7 FALSE
q: setting r4c5#6 FALSE
R: The hypothesis is linked by r2c1#6 chain 4(1)
r: The hypothesis is proven if chain 4(1) is proven to be FALSE
S: The hypothesis is proven if any of the following weakly associated nodes 4(1) are TRUE:
S: setting r2c1#1 TRUE
S: setting r2c1#4 TRUE
S: setting r2c1#9 TRUE
T: The hypothesis is linked by r4c1#7 chain 13(1)
T: setting r4c2#7 TRUE chain 13 parity 0
t: The hypothesis is proven if chain 13(1) is proven to be FALSE
U: The hypothesis is proven if any of the following weakly associated nodes 13(1) are TRUE:
U: setting r1c1#7 TRUE
U: setting r3c1#7 TRUE
U: setting r7c1#7 TRUE
U: setting r8c1#7 TRUE
u: cell r4c2 is nearly all TRUE for #3, so a FALSE there forces one of the others TRUE
u: The hypothesis is proven if any of the following are forced FALSE:
u: setting r4c2#3 FALSE
V: The hypothesis is linked by r4c2#3 chain 7(1)
V: setting r6c2#3 TRUE chain 7 parity 0
v: The hypothesis is proven if chain 7(1) is proven to be FALSE
W: The hypothesis is proven if any of the following weakly associated nodes 7(1) are TRUE:
W: setting r4c5#3 TRUE
w: column 5 is nearly all TRUE for #6, so a FALSE there forces one of the others TRUE
w: 3x3 block 5 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
w: cell r6c2 is nearly all TRUE for #9, so a FALSE there forces one of the others TRUE
w: row 6 is nearly all TRUE for #5, so a FALSE there forces one of the others TRUE
w: The hypothesis is proven if any of the following are forced FALSE:
w: setting r6c5#3 FALSE
w: setting r6c2#9 FALSE
X: The hypothesis is proven if any of the following nodes are TRUE:
X: setting r6c5#2 TRUE
X: setting r6c1#9 TRUE
X: setting r6c6#9 TRUE
X: setting r3c2#9 TRUE
X: setting r7c2#9 TRUE
X: setting r5c3#9 TRUE
Y: The hypothesis is linked by r6c5#2 chain 15(1)
y: The hypothesis is proven if chain 15(0) is proven to be FALSE
y: setting r6c6#2 FALSE chain 15 parity 0
Z: The hypothesis is proven if any of the following weakly associated nodes 15(0) are TRUE:
Z: setting r7c6#2 TRUE
Z: setting r9c6#2 TRUE
z: cell r5c3 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
z: row 5 is nearly all TRUE for #6, so a FALSE there forces one of the others TRUE
z: cell r7c6 is nearly all TRUE for #4, so a FALSE there forces one of the others TRUE
z: The hypothesis is proven if any of the following are forced FALSE:
z: setting r5c3#8 FALSE
z: setting r5c6#9 FALSE
z: setting r7c6#4 FALSE
A: The hypothesis is linked by r5c3#8 chain 14(0)
a: The hypothesis is proven if chain 14(0) is proven to be FALSE
B: The hypothesis is proven if any of the following weakly associated nodes 14(0) are TRUE:
B: setting r3c3#8 TRUE
B: setting r8c3#8 TRUE
b: cell r8c3 is nearly all TRUE for #7, so a FALSE there forces one of the others TRUE
b: The hypothesis is proven if any of the following are forced FALSE:
b: setting r8c3#7 FALSE
C: The hypothesis is proven if any of the following nodes are TRUE:
C: setting r8c8#7 TRUE
C: setting r3c3#7 TRUE
C: setting r7c2#7 TRUE
C: setting r9c2#7 TRUE
D: The hypothesis is linked by r8c8#7 chain 23(1)
d: The hypothesis is proven if chain 23(0) is proven to be FALSE
d: setting r9c8#7 FALSE chain 23 parity 0
E: The hypothesis is proven if any of the following weakly associated nodes 23(0) are TRUE:
E: setting r9c8#4 TRUE
E: setting r9c5#7 TRUE
e: 3x3 block 1 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
e: column 2 is nearly all TRUE for #3, so a FALSE there forces one of the others TRUE
e: row 7 is nearly all TRUE for #5, so a FALSE there forces one of the others TRUE
e: column 8 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
e: cell r8c8 is nearly all TRUE for #4, so a FALSE there forces one of the others TRUE
e: 3x3 block 9 is nearly all TRUE for #5, so a FALSE there forces one of the others TRUE
e: cell r9c5 is nearly all TRUE for #2, so a FALSE there forces one of the others TRUE
e: The hypothesis is proven if any of the following are forced FALSE:
e: setting r3c2#7 FALSE
e: setting r7c5#7 FALSE
e: setting r8c8#4 FALSE
e: setting r9c5#2 FALSE
F: The hypothesis is linked by r7c5#7 chain 19(1)
f: The hypothesis is proven if chain 19(1) is proven to be FALSE
G: The hypothesis is proven if any of the following weakly associated nodes 19(1) are TRUE:
G: setting r7c5#2 TRUE
g: row 7 is nearly all TRUE for #2, so a FALSE there forces one of the others TRUE
g: The hypothesis is proven if any of the following are forced FALSE:
g: setting r7c2#2 FALSE
H: The hypothesis is linked by r7c2#2 chain 6(1)
H: setting r9c2#2 TRUE chain 6 parity 0
h: The hypothesis is proven if chain 6(1) is proven to be FALSE
I: The hypothesis is proven if any of the following weakly associated nodes 6(1) are TRUE:
I: setting r7c2#4 TRUE
J: The hypothesis is linked by 6(1)/21(0)
j: The hypothesis is proven if chain 21(1) is proven to be FALSE
j: setting r7c1#9 FALSE chain 21 parity 1
K: The hypothesis is proven if any of the following weakly associated nodes 21(1) are TRUE:
K: setting r3c1#9 TRUE
K: setting r7c1#4 TRUE
L: The hypothesis is proven if any of the following nodes are TRUE:
L: setting r3c9#7 TRUE
L: setting r3c2#4 TRUE
L: setting r3c2#8 TRUE
L: setting r8c1#4 TRUE
L: setting r8c2#4 TRUE
M: The hypothesis is linked by r3c9#7 chain 1(0)
M: setting r1c9#1 TRUE chain 1 parity 0
m: The hypothesis is proven if chain 1(1) is proven to be FALSE
m: setting r1c1#1 FALSE chain 1 parity 1
m: setting r1c9#7 FALSE chain 1 parity 1
m: setting r2c9#1 FALSE chain 1 parity 1
N: The hypothesis is proven if any of the following weakly associated nodes 1(1) are TRUE:
N: setting r2c2#1 TRUE
N: setting r8c1#1 TRUE
N: setting r2c9#4 TRUE
n: column 1 is nearly all TRUE for #3, so a FALSE there forces one of the others TRUE
n: 3x3 block 1 is nearly all TRUE for #7, so a FALSE there forces one of the others TRUE
n: cell r2c2 is nearly all TRUE for #4, so a FALSE there forces one of the others TRUE
n: row 2 is nearly all TRUE for #2, so a FALSE there forces one of the others TRUE
n: 3x3 block 3 is nearly all TRUE for #9, so a FALSE there forces one of the others TRUE
n: row 3 is nearly all TRUE for #1, so a FALSE there forces one of the others TRUE
n: cell r3c9 is nearly all TRUE for #4, so a FALSE there forces one of the others TRUE
n: 3x3 block 7 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
n: cell r8c1 is nearly all TRUE for #8, so a FALSE there forces one of the others TRUE
n: column 9 is nearly all TRUE for #3, so a FALSE there forces one of the others TRUE
n: The hypothesis is proven if any of the following are forced FALSE:
n: setting r3c1#4 FALSE
n: setting r3c1#8 FALSE
n: setting r2c2#4 FALSE
n: setting r3c9#4 FALSE
n: setting r9c2#4 FALSE
n: setting r8c1#8 FALSE
n: Two values in Row 3 for #4, either false, proves the hypothesis
|
Holy cow!!!
_________________
Bob Hanson
Professor of Chemistry
St. Olaf College
Northfield, MN
http://www.stolaf.edu/people/hansonr |
|
| Back to top |
|
|
| Lummox JR
| | Joined: 07 Sep 2005 | | Posts: 202 | | : | |
Items |
|
| Posted: Thu Nov 03, 2005 5:23 am Post subject: |
|
|
| Haelian wrote: | | ya, i cheated and used a program i made in a couple weeks, but as you can see it did a number on it. (took 3-4 minutes i think) |
That's #75 from the top95 set, and as far as my solver can tell it kicks the crap out of the "toughest known puzzle", which may be due for a renaming.
| Quote: | i didn't make the program to be able to solve puzzles easily, i took it as a challenge to program something for fun. i wouldn't know why anyone would make one otherwise, it's not a very useful program really.
P.S. see you on BYOND Lummox |
Hey, a fellow BYONDer! Now there's a welcome surprise. I came here while attempting to implement a sudoku generator (encompassing also a human-style solver) in DM for a possible BYOND version of sudoku. It'd be a great concept if it wasn't so slow, although I'm wondering now if implementing dancing links with actual double-linked lists might be faster. DM takes a good chunk of a second to generate a minimal sudoku grid with the algorithm I used, and after that if you want to make a decent game for the audience at hand you have to sift a large number of puzzles for the desired difficulty.
| Quote: | | Edit: ran it again using the same puzzle, did it in about half the time (2 minutes 19 seconds). my program isn't very efficient, whenever it gets to an impossible fill (meaning it made a mistake along the way) it picks a number between 1 and 9 randomly to put in and sets all of the same numbers within the horizontal/vertical/square to 0 (which it then fills in during the next pass). |
Have you tried implementing dancing links? It will certainly solve a puzzle in decent time, since it's a backtracking algorithm. It's what I use to set the initial puzzle by narrowing it down to 1 solution and then removing clues to see if it still works. The framework for the algorithm also makes a good framework for implementing all kinds of human-style logic tests. |
|
| Back to top |
|
|
| Haelian
| | Joined: 03 Nov 2005 | | Posts: 3 | | : | | Location: MA |
Items |
|
| Posted: Thu Nov 03, 2005 10:51 pm Post subject: |
|
|
| Lummox JR wrote: | | Have you tried implementing dancing links? It will certainly solve a puzzle in decent time, since it's a backtracking algorithm. It's what I use to set the initial puzzle by narrowing it down to 1 solution and then removing clues to see if it still works. The framework for the algorithm also makes a good framework for implementing all kinds of human-style logic tests. |
oh god, the horror of me trying to read other programs. i guess i just have a knack for being terrible at it. but that's not the main problem, which is the fact that my program's written in java, so i'd have to rewrite the entire thing. seems like you may have to do just that though (in DM). i don't have the patience for it (or the C++ knowledge really).
| Lummox JR wrote: | | I came here while attempting to implement a sudoku generator (encompassing also a human-style solver) in DM for a possible BYOND version of sudoku. It'd be a great concept if it wasn't so slow, although I'm wondering now if implementing dancing links with actual double-linked lists might be faster. |
i'd LOVE to see a Sudoku BYOND game out there. orgasms may ensue. although it may be tough to hold the minds of BYOND fanatics' attention long enough to actually solve a puzzle. yep, seems like a challenge. |
|
| Back to top |
|
|
| Lummox JR
| | Joined: 07 Sep 2005 | | Posts: 202 | | : | |
Items |
|
| Posted: Thu Nov 03, 2005 11:14 pm Post subject: |
|
|
| Haelian wrote: | | i'd LOVE to see a Sudoku BYOND game out there. orgasms may ensue. although it may be tough to hold the minds of BYOND fanatics' attention long enough to actually solve a puzzle. yep, seems like a challenge. |
I could probably vastly broaden the appeal within the BYOND community by using Dragonball Z characters in place of numbers.  |
|
| Back to top |
|
|
| Haelian
| | Joined: 03 Nov 2005 | | Posts: 3 | | : | | Location: MA |
Items |
|
| Posted: Fri Nov 04, 2005 2:36 am Post subject: |
|
|
| Lummox JR wrote: | | I could probably vastly broaden the appeal within the BYOND community by using Dragonball Z characters in place of numbers. |
hilarious, but true. i don't understand why so many people make their own Dragonball Z rip-off games. can't they tell there are already 2 dozen under unpublished games? usually i just sift through anything/anyone involving the word "Goku" or "SSJ." |
|
| Back to top |
|
|
|
|
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
|
Powered by phpBB © 2001, 2005 phpBB Group
Igloo Theme Version 1.0 :: Created By: Andrew Charron |
FAQ
Search
Memberlist
Usergroups
Register
Profile
Log in
Log in to check your private messages
