logo

Maze Solving Algorithm Implementation

   

Added on  2019-09-20

1 Pages263 Words147 Views
 | 
 | 
 | 
#include <stdio.h>int getTotalKeys();int getCurrentKeys();int getNumSteps(); // returns the number of steps which you have made so far. Might be useful for debugging purposes.void getCurrentPosition(int * arr); // this puts the player's row into arr[0],and the player's column into arr[1].void readMaze(); // points will be taken off if you use this.void printMaze(); // prints the current maze. Might be useful for debugging.int isComplete(); //returns 1 if the maze is complete, and 0 otherwise. Usefulfor loop conditionsint move(int newRow, int newCol); // if possible, it moves the player to the position specified. If not possible, it prints a handy error message explaining what happened. You are definitely allowed to comment out the print statements if you get tired of seeing the error messages.int look(int newRow, int newCol); // if possible, it tells you what's in the square you are looking at. It also returns the integer value of what is in thesquare (see maze file explanation). If not possible, it prints a handy error message explaining what happened. You are definitely allowed to comment out the print statements if you get tired of seeing the error messages.
Maze Solving Algorithm Implementation_1

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents
Maze Solver
|2
|405
|183

Maze Solver Header
|2
|917
|172

Navigating the Maze
|4
|1383
|50