Advertisement
Guest User

Untitled

a guest
Jan 17th, 2017
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.02 KB | None | 0 0
  1. # Solving the Maze
  2.  
  3. Your instructions here are simple, but the implementation not so much. The goal is
  4. to build a maze solver that takes a string as input and returns the (x,y) coordinates
  5. of the goal location. The maze is as follows:
  6.  
  7. ```
  8. 00000000000000E00000000000
  9. 00011110101010101000000100
  10. 00000011111111111111111100
  11. 00000010101010101010100000
  12. 00011111111110001010100000
  13. 000X0000000000000000000000
  14. ```
  15.  
  16. And the rules for navigating the maze are as follows:
  17.  
  18. - Every space marked `0` is a wall. you can't move onto or through a wall.
  19. - Every space marked `1` is open. You can move to any open space that is above, below, left, or right of your current position.
  20. - The space marked `E` is the entrace of the maze and where you start navigating from.
  21. - The space marked `X` is the goal of the maze and where you want to navigate to.
  22. - The origin block (0, 0) of the maze is in the lower left hand corner
  23.  
  24. Now, of course, you could just find the coordinates of `X` by looking at your map representation.
  25. But that defeats the point of this exercise. In fact, the coordinates are important to know so that
  26. you can test your implementation. The entrance point is at (14, 5) and the goal is at (3, 0).
  27.  
  28. # The Randori
  29.  
  30. This exercise works by setting up two
  31.  
  32. ## Rules
  33.  
  34. - Two practioners will be chosen. One will be the "driver" who operates the computer and the other a "navigator"
  35. who has some say in how the solution is designed
  36. - Every 5 minutes the current "driver" will move to the audience, the current "navigator" will become the "driver"
  37. and a member of the audience will be chosen to become the new "navigator"
  38. - The driver and navigator must write write tests before writing code
  39. - Code must be written to satisfy a failing test
  40. - The audience cannot contribute anything until all tests are green
  41. - Once tests are green, the audience can (respectfully!) contribute improvements to the code
  42. - If tests start failing again, the audience must be silent
  43. - You cannot use any modules outside the Elixir and Erlang standard libraries
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement