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

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_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

I did something similar a while ago with Lone wolf books: https://notes.atomutek.org/gamebooks-and-graph-theory.html

I didn't become a reverse engineer but that landed me a job when I was explaining how I used networkx library and handled a couple of edges around detecting cycles during the interview :)

Nerd.

... that's pretty cool.

Hey mike_d, I remember this as well. Using my google-fu, I found it. Google: "hopper disassembler" copyright text OR string

https://alexomara.com/blog/a-silly-anti-disassembly-trick/

backup links:

https://web.archive.org/web/20210830080742/https://alexomara...

https://archive.is/uzga3

From the article:

> One of the limitations to at-least the demo of Hopper is that it is not able to disassemble itself.

I was curious as to whether this limitation was present in the latest licensed version of Hopper (4.8.2).

I can confirm that I can indeed disassemble Hopper itself. Whether there's some intentional mistakes in that disassembly I don't really have time to delve into, unfortunately.