learn-code-the-hard-way
/
roguish
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
21 Commits
1 Branch
0 Tags
3.5 MiB
Tag: Branch: Tree: a37a40d45f
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'a37a40d45f'
${ noResults }
Commit Graph

8 Commits (a37a40d45f2b7696e65f6f7da9c42a49778cddbd)

Author SHA1 Message Date
Zed A. Shaw 62195e6eea A dirty first cut at a single random horiz/vert split for the BSP algorithm.
2 months ago
Zed A. Shaw 6cb3366912 I can make a map with one room 'randomly' generated and calculate paths.
2 months ago
Zed A. Shaw 8b67a25732 Cleaned up the map for more work.
2 months ago
Zed A. Shaw 4f863c2635 Dijkstra thing is working on a sample map.
2 months ago
Zed A. Shaw c6d298023a Need the test file.json
2 months ago
Zed A. Shaw ebb5360c5c Fixed the bug that made walls not receive the algorithm.
2 months ago
Zed A. Shaw 4d748d1f48 Initial Dijkstra algorithm for the map, but doesn't quite work right. The walls in the wall_map are not accounted for in the algorithm.
2 months ago
Zed A. Shaw ad143dca05 Initial commit that has most of what I need.
2 months ago