Dungeons, Dragons, and Graph Databases.
summary
Procedural dungeon generator writes nodes and relationships into RedisGraph and code sits on GitHub; running npm start seeds a random dungeon and a Cypher query finds the shortest path to the room with the most gold. Examples: a +1 sword worth 1,250 gp and a chest of 75 gp appear in demos, queries use the Cypher wildcard hop ([:LEADS_TO*1..3]) to limit hops, MATCH/RETURN extracts node lists and path lengths so the optimal route and distance are returned.
AI-written summary · about
chapters (10)
- 0:00Start
- 6:32using a Graph Database
- 11:13A Directed Graph
- 20:39Creating Rooms
- 24:09Deleting Rooms
- 31:27Farming All the XP!
- 34:10Connecting Rooms
- 37:04Variable Length Relationships
- 40:26Ghe Longest Path Ghrough the Dungeon!
- 47:00Practical Applications
related talks
31mDungeons, Dragons, and Graph Databases
52mDungeons, Dragons, and Graph Databases
01h 01mDungeons, Dragons, and Graph Databases
32mGraph Databases, and Dungeons and Dragons
26mGraph Databases will change your (freakin') life
01h 00mWho’s Afraid of Graphs?
49mModern Graph Databases
55mA Practical Guide to Graph Databases