search

RoboticsClubAtUCDavis / micromouse

4 stars 3 forks source link

Implement Mapping Strategy 3 #83

Closed blhough closed 7 years ago

blhough commented 7 years ago

Closes #44

This got quite large.. but the commits are discrete so I can split this into multiple PRs if requested.

The mapping algorithm is not very efficient, nor does it map in the minimum number of moves but it is a start. I plan to expand it later on, but this will work fine for testing.

The simulation looks super cool and was pretty easy to extend thanks to the solid foundation Ian provided.

Mouse now has two Maze objects during simulation. The new one is called virtualMaze and holds all the information from the loaded/generate maze. The original maze, maze starts empty and is filled as the mouse maps and is what gets drawn to screen. image

ids1024 commented 7 years ago

It looks nice. I think we want to display walls the mouse hasn't found, but grayed out. But doesn't have to be done before this is merged.

blhough commented 7 years ago

@klanmiko Let me know if you need any help merging, merge conflicts can be a pain. Also don't let any decisions I made in mapping necessarily affect how you choose to implement yours. If you want a data structure for explored nodes go for it.