User Tools

Site Tools


Writing /var/www/html/conf/plugins.local.php failed
codeapalooza:challenge_5

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
codeapalooza:challenge_5 [2010/12/10 15:42]
jason
codeapalooza:challenge_5 [2010/12/10 15:43]
jason
Line 1: Line 1:
 ====== The Challenge ====== ====== The Challenge ======
-{{:codeapalooza:maze.bmp|}} 
-{{:codeapalooza:random.bmp|}} 
-{{:codeapalooza:text.bmp|}} 
  
 You are given 2 random, valid points (start, end) and a random terrain map. You must find the shortest distance between the two starting points without going through any out-of-bounds terrain. You are given 2 random, valid points (start, end) and a random terrain map. You must find the shortest distance between the two starting points without going through any out-of-bounds terrain.
Line 8: 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 "wall" or invalid.+The terrain map will be a 2d array measuring 256x256. For testing, we will all be given the same 3 .bmp files (below) representing the terrain. Each bitmap will measure 256x256 pixels in dimensions with white being marked as valid and black being marked as a "wall" or invalid.
  
 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 18: 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.
  
 +{{:codeapalooza:maze.bmp|}} 
 +{{:codeapalooza:random.bmp|}} 
 +{{:codeapalooza:text.bmp|}}
  
codeapalooza/challenge_5.txt · Last modified: 2010/12/10 15:43 by jason