Search found 37 matches
- Thu Dec 11, 2008 1:21 am
- Forum: Volume 102 (10200-10299)
- Topic: 10270 - Bigger Square Please...
- Replies: 25
- Views: 14886
Re: 10270 - Bigger Squares Please
Amazingly I found a couple places of improvement in my code above that resulted in about a 45% faster program. I updated the code in my post above, I edited 'tile' slightly by adding an extra else statement, and I also edited 'getMax' slightly by precalculating the startup maxvalue at the current po...
- Mon Dec 08, 2008 3:59 am
- Forum: Volume 102 (10200-10299)
- Topic: 10270 - Bigger Square Please...
- Replies: 25
- Views: 14886
Re: 10270 - Bigger Squares Please
This is my java code without my GUI stuff with it to view the squares once completed. public BSP(int squareSize) { this.squareSize = squareSize; squareGrid = new int[squareSize*squareSize]; amounts = new int[squareSize]; solution = new int[squareGrid.length]; calcDist = new int[squareGrid.length]; f...
- Mon Dec 08, 2008 1:08 am
- Forum: Volume 102 (10200-10299)
- Topic: 10270 - Bigger Square Please...
- Replies: 25
- Views: 14886
Re: 10270 - Bigger Squares Please
Hi poixp, You did a good job with the techniques you supplied. I have enjoyed this problem for quite some time and my solving program uses most all of those to find minimal solutions. My tip is to remove #5 in your list as there are minimal solutions that don't use a square of size 1, which are 19,3...
- Tue Feb 12, 2008 4:34 am
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
- Mon Feb 11, 2008 11:54 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
- Sat Feb 09, 2008 9:30 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
The few places I ran into RE with this problem was reading the goal cordinates in the wrong order. I also missed the fact that goal cordinates can have 2 digits. The last place I had trouble with RE was related to reading the cordinates wrong, and happened when the program would check a square that ...
- Wed Jan 16, 2008 7:38 am
- Forum: Volume 113 (11300-11399)
- Topic: 11392 - Binary*3 Type Multiple
- Replies: 14
- Views: 6612
- Wed Jan 09, 2008 1:31 am
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
I think they finally got around to fixing it cause I got accepted now :). I however don't understand why my implementation of a priority queue for A* got WA. I assume it's because it returns a non lexigraphic solution. Shouldn't the priority queue be sorted by depth+heruistic, and if that is equal t...
- Tue Jan 08, 2008 4:18 am
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
- Mon Jan 07, 2008 9:50 am
- Forum: Volume 113 (11300-11399)
- Topic: 11382 - Fear of The Dark
- Replies: 8
- Views: 3117
- Mon Jan 07, 2008 7:39 am
- Forum: Volume 113 (11300-11399)
- Topic: 11382 - Fear of The Dark
- Replies: 8
- Views: 3117
- Mon Jan 07, 2008 1:33 am
- Forum: Volume 113 (11300-11399)
- Topic: 11382 - Fear of The Dark
- Replies: 8
- Views: 3117
11382 - Fear of The Dark
I have been trying for a while now to find the best way to do this problem. :o. The way I am thinking about doing this problem is as follows: Read a ghost's posistion, check and see if this ghost is independent from all other ghosts. I define independent as that its angle between its two points from...
- Sat Jan 05, 2008 8:09 am
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
- Wed Jan 02, 2008 8:36 am
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
Well I improved upon my program, and made a BFS solution that can solve the 53 step maze in ~11s. Not sure if Ill be able to improve it without fully understanding how to add the hueristic function into my program without killing it :) (I have tried adding some hueristic but so far it doesn't work i...
- Mon Dec 31, 2007 11:31 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11376 - Tilt!
- Replies: 40
- Views: 12101
Ok I have a decent understanding of how A* works. Another helpful site I found was http://www.policyalmanac.org/games/aStarTutorial.htm . The problem I am having now is figuring out how to use it for multiple goals, which I don't see being easy to do.