From 9e23d9eb47fd1a733f488a74057dbbe34f30704c Mon Sep 17 00:00:00 2001 From: Brandon Rodriguez <brodriguez8774@gmail.com> Date: Thu, 8 Oct 2020 23:25:23 -0400 Subject: [PATCH] Update readme --- README.md => readme.md | 13 ++++--------- 1 file changed, 4 insertions(+), 9 deletions(-) rename README.md => readme.md (98%) diff --git a/README.md b/readme.md similarity index 98% rename from README.md rename to readme.md index 3d04b13..7ef1857 100644 --- a/README.md +++ b/readme.md @@ -1,11 +1,7 @@ -# Assignment 2 - C# Recursion Maze +# C# - Recursion Maze -## Author - -Brandon Rodriguez ## Description - Program which creates and solves a maze using recursion and an attempt at "self-updating entity" logic. User is given a menu. They can create new mazes (both premade and randomly generated), display and solve the mazes, or adjust settings of the maze's display. @@ -20,8 +16,8 @@ The maze generation should work with all sizes (as long as it fits within the co UI is "static" in that it doesn't scroll like a standard console application. -## Project Requirements +## Project Requirements You must write a program to traverse a 12 x 12 maze and find a successful path from a starting point to an exit. You are given a hard coded maze in the program, as well as some starting coordinates. Each spot in the maze is represented by either a '#' or a '.' (dot). The #'s represent the walls of the maze, and the dots represent paths through the maze. Moves can be made only up, down, left, or right (not diagonally), one spot at a time, and only over paths (not into or across a wall). The exit will be any spot that is on the outside of the array. As your program attempts to find a path leading to the exit, it should place the character 'X' in each spot along the path. If a dead end is reached, your program should replace the X’s with '0'. But, the spots with '0' should be marked back to 'X' if these spots are part of a successful path leading to a final state. The output of your program is the maze configuration after each move. In your testing, you may assume that each maze has a path from its starting point to its exit point. If there is no exit, you will arrive at the starting spot again. There is a method stub in the main program for transposing the 2D array. The progarm is setup to solve both the orignal maze, and the transposed maze. Your program should be able to solve both of them without any issue. @@ -37,13 +33,12 @@ Comment anything else that isn't obvious about what you are trying to do in the I also want you to comment the recursive method you implement thoroughly to show me that you know what is going on inside your method. ### Notes - It might be useful while developing this program to use a smaller sized maze, and then get it to work with the real ones. Don't forget that you must have a base case for your recursive method or you will continue to get a stack overflow. -## Outside Resources Used +## Outside Resources Used http://stackoverflow.com/questions/5449956/how-to-add-a-delay-for-a-2-or-3-seconds https://msdn.microsoft.com/en-us/library/hh194873%28v=vs.110%29.aspx * Used to figure out how to add a delay to console output. Prior to the delay, the program would solve itself way too fast for the user to follow. @@ -74,8 +69,8 @@ https://msdn.microsoft.com/en-us/library/system.console.setcursorposition%28v=vs https://msdn.microsoft.com/en-us/library/system.console.windowwidth%28v=vs.110%29.aspx * Got rid of annoying console flickering when creating/solving a new maze! Yay! -## Known Problems, Issues, And/Or Errors in the Program +## Known Problems, Issues, And/Or Errors in the Program * Maze generation works best when a larger size. The 10 to 20 tile range seems ideal. * Depending on the version of windows, console may or may not display correctly when adjusting the tile width/space properties. For example, setting one of them to 3 and the other to 2 seems to display fine on windows 10. However you can only set one of them to 2 and the other to 1 (at most) to display properly on windows 8. -- GitLab