Maze Dev C++

A program that be greatly simplified by the use of recursion, escaping a mzae. In each maze cell the mouse stores on the maze stack up to four cells neighboring the cell in which it is currently located. The cells put on the stack are the ones that should be investigated after reaching a dead end. It does the same for each visited cell. Write a program that uses recursion to solve the maze problem. Use the following pseudocode: exitCell(currentCell) if currentCell *is the exit success;* * * else exitCell(the passage above currentCell); exitCell(the passage below currentCell); exitCell(the passage left to currentCell); exitCell(the passage right to currentCell); CODE SHOULD INCLUDE COMMENTS... COMPILE IN DEV C++ 4.0 Attached you will find maze code work already completed... ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Windows 2000 and XP, compile and run with Dev C++ 4.0