I was so obsessed with this when I was a kid. I created a complete node graph a few years ago in order to cheat and to show the entire tree structure of the boo

I was so obsessed with this when I was a kid. I created a complete node graph a few years ago in order to cheat and to show the entire tree structure of the book: https://archive.org/details/magic-master-node-map https://archive.org/details/magic-master-node-map I simply didn't have enough fingers to bookmark previous pages if I made a choice which led to a bad ending. This was my first taste of depth-first search algorithm. With the graph visualization as an oracle, I was able to explore all threads leading to all the different possible endings. You can read this book in OpenLibrary: https://openlibrary.org/works/OL30096W/Choose_Your_Own_Adventure_-_Magic_Master?edition=key%3A/books/OL7825409M https://openlibrary.org/works/OL30096W/Choose_Your_Own_Adven... I carried my childhood obsession with me all the way to Ghidra / IDA debugger which shows the disassembly blocks with arrows in its graph view. I'm now a Reverse Engineer thanks to the Choose Your Own Adventure books I've obsessed over and read a lot as a kid. :D