Zed A. Shaw
|
68d6b9e90c
|
If you invert the walls and the input map then you might be able to use the dijkstra map to find interesting paths between rooms.
|
2024-09-28 04:25:09 -04:00 |
|
Zed A. Shaw
|
997a3ab45b
|
Lots of nice options for tweaking and settings. Next step is the cleanup and then connecting rooms.
|
2024-09-28 04:07:32 -04:00 |
|
Zed A. Shaw
|
f48f9d9bc5
|
If you just pick the wider of the dimensions then you get a more even spread vs random direction.
|
2024-09-28 04:06:30 -04:00 |
|
Zed A. Shaw
|
5f09747109
|
If you just pick the wider of the dimensions then you get a more even spread vs random direction.
|
2024-09-28 04:01:29 -04:00 |
|
Zed A. Shaw
|
e1ebea7451
|
Working mostly correct now, just need to tweak how it works more and work on connections.
|
2024-09-28 03:58:26 -04:00 |
|
Zed A. Shaw
|
61d2747441
|
It's working way better now, with correct internal dimensions, but I'm drawing the wrong nodes, need to go depth first.
|
2024-09-28 03:09:19 -04:00 |
|
Zed A. Shaw
|
56cc38006b
|
NOTWORKING: Committing this so I can show the changes I made on the next stream.
|
2024-09-28 02:44:36 -04:00 |
|
Zed A. Shaw
|
62195e6eea
|
A dirty first cut at a single random horiz/vert split for the BSP algorithm.
|
2024-09-27 18:42:32 -04:00 |
|
Zed A. Shaw
|
6cb3366912
|
I can make a map with one room 'randomly' generated and calculate paths.
|
2024-09-27 00:10:41 -04:00 |
|
Zed A. Shaw
|
8b67a25732
|
Cleaned up the map for more work.
|
2024-09-26 23:14:42 -04:00 |
|
Zed A. Shaw
|
4f863c2635
|
Dijkstra thing is working on a sample map.
|
2024-09-26 17:56:40 -04:00 |
|
Zed A. Shaw
|
ebb5360c5c
|
Fixed the bug that made walls not receive the algorithm.
|
2024-09-26 16:55:42 -04:00 |
|
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.
|
2024-09-26 01:22:25 -04:00 |
|