At first I thought this project was going to be relatively simple to implement, but it ended up being pretty challenging (but fun) to do. The difficulty here was actually in the discovery of inference methods, rather than their implementation.

This was my first time learing and applying set theory, although it wasn't until after I had started work on the inference logic that I realized how much it applied to my work. (Speaking of: I've also tried to document the theory/proof behind what my code does on a page in that repo. Hopefully it's as interesting to read as it was to write!)

I also decided to evenually port the core of the inference logic to Rust (via WebAssembly), because I noticed performance issues for a feature to determine the most likely guilty cards (since it just brute-forces all possible hand arrangements given the current data). That was my first time using WASM.

After the initial port to Rust and the performance improvements that brought, I started trying to to optimize my code way more. I've managed to make it something like 30× faster than it was with the original TypeScript, even while adding new and often complex inference methods.