DFS???? Map???
What is it????
I just know basic structures such as BST, TST...
Search found 4 matches
- Wed Mar 10, 2004 5:07 pm
- Forum: Volume 6 (600-699)
- Topic: 604 - The Boggle Game
- Replies: 33
- Views: 12963
- Wed Mar 10, 2004 1:42 pm
- Forum: Volume 6 (600-699)
- Topic: 604 - The Boggle Game
- Replies: 33
- Views: 12963
604 Boggle game, HELP!!!!
Hello!!!
I'm not able to solve this problem, because I get "Time Limit Exceeded" all time. Is there any method to solve the problem more quickly?
My algo is:
- Generate all possible words of the first board with two vowels and with its letters one on side the other in the board, and store it in a ...
I'm not able to solve this problem, because I get "Time Limit Exceeded" all time. Is there any method to solve the problem more quickly?
My algo is:
- Generate all possible words of the first board with two vowels and with its letters one on side the other in the board, and store it in a ...
- Thu Mar 04, 2004 5:48 pm
- Forum: Volume 6 (600-699)
- Topic: 604 - The Boggle Game
- Replies: 33
- Views: 12963
Possible solution
I generate all word just iterating (I think I used four ar five iterators one "inside" the other).
Please, could anybody tell me some method (that I were able to understand... it's so difficult) to generate the words faster???
Thanks!!!!
Please, could anybody tell me some method (that I were able to understand... it's so difficult) to generate the words faster???
Thanks!!!!
- Wed Mar 03, 2004 10:06 pm
- Forum: Volume 6 (600-699)
- Topic: 604 - The Boggle Game
- Replies: 33
- Views: 12963
604 (boggle game) Time limit exceeded
Hello!!!!
I'm trying to solve to 604 proble. It runs correctly, but it is using to much time. Does anybody know any method to be faster?? Here goes my method:
1. Generate all possible words of 4 letters from the first square.
2. Look if each letter of each word have a corner or edge in common in ...
I'm trying to solve to 604 proble. It runs correctly, but it is using to much time. Does anybody know any method to be faster?? Here goes my method:
1. Generate all possible words of 4 letters from the first square.
2. Look if each letter of each word have a corner or edge in common in ...