The DX-Mars Project

 

What is it?      Why use it?    Requirements        Screenshots         Resources      Contact

 

 

DX-Mars is designed to replace the trivial and tedious console I/O programming assignments that are currently so prevalent in early CS courses.  These simple and boring text-based assignments can become frustrating causing students to lose interest quickly, often in computer science as a whole.  The goal of DX-Mars is to show the power and relevance of computer science in general, by providing a fun and significant domain in which students can work. 

 

 

 

§         The knapsack problem. (sorting)  The rover collects rock and fossil samples, with varying values, and must pack them into its inventory.

 

§         The traveling salesman problem. (tree traversal algorithms)  The rover is given a set of coordinates by a reconnaissance satellite, and must visit them all efficiently.

 

§         A* pathing.  Simply add costs to the tiles for a suitable A* domain. 

 

§         Binary space partition trees.  (tree generation)  Adding a  3-D view of the world, BSPs can be used for rendering sections of the map.