This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
codeapalooza:challenge_5 [2010/12/10 15:40] jason |
codeapalooza:challenge_5 [2010/12/10 15:43] (current) jason |
||
---|---|---|---|
Line 5: | Line 5: | ||
This is a path finding algorithm challenge. The success of your efforts will be based upon how fast your algorithm can discover the quickest path. | This is a path finding algorithm challenge. The success of your efforts will be based upon how fast your algorithm can discover the quickest path. | ||
- | The terrain map will be a 2d array measuring 256x256. For testing, we will all be given the same 3 .bmp files representing the terrain. Each bitmap will measure 256x256 pixels in dimensions with white being marked as valid and black being marked as a " | + | The terrain map will be a 2d array measuring 256x256. For testing, we will all be given the same 3 .bmp files (below) |
When we test our solutions, new .bmp's will be generated to do our benchmarking. | When we test our solutions, new .bmp's will be generated to do our benchmarking. | ||
Line 15: | Line 15: | ||
* Your character being 2x2 pixels in dimension. It can only go through path ways that are at least 2 pixels wide. This applies to both animated characters (if any) and the general algorithm itself. | * Your character being 2x2 pixels in dimension. It can only go through path ways that are at least 2 pixels wide. This applies to both animated characters (if any) and the general algorithm itself. | ||
+ | {{: | ||
+ | {{: | ||
+ | {{: | ||