Hi everyone,
I’m working on a small side project to model relationships in games and puzzles using graph concepts, and I had a question that felt relevant here. Some word games rely on chaining rules and constraints between letters or words, kind of like a little letter-link challenge, where each step depends on the previous one.
If you were modeling this type of logic in neo4j, would you recommend representing each letter/word as nodes with directional relationships, or would a path-based approach be more efficient for querying valid chains? I’m also curious about related concerns like performance when paths get longer, or how to prevent cycles without overly complex queries.
Would love to hear how others here have approached modeling game-like or rule-based sequences in neo4j.