minimax-rs VS nokamute

Nokamute was developed to have very fast move generation for this atypical game structure; this is mainly difficult because the game state does not have a fixed size. Rust has been a great language to micro-optimize performance. I developed the minimax crate in parallel to implement fancy 20th century game search algorithms in a generic way. If anyone else starts using it and doesn't hate the interface I'll stamp it 1.0.

Repo, Minimal reproduction

I've looked at a number of implementations of the board game Hive, which uses a technically unbounded hexagonal layout. Most of them have read your article and really like the 3-axis cube system, usually with hash table representation. As the core of a minimax engine, this is very inefficient, so my engine uses a [wrapping 16x16 rhombus](https://github.com/edre/nokamute/blob/master/src/hex_grid.rs) in a packed 256-entry array. The adjacency operations are very fast, but I have yet to come up with a way to efficiently compute distance...

After a couple years of on-and-off development, I've anointed v1.0 of nokamute. It's a bot that plays the board game Hive. Briefly, hive is like chess with hexagonal bugs without a board.

I wrote a hive AI in rust, and somehow I never discovered the hex-spiral crate. Neat!

Nokamute, for this you will need Mzinga to run it with a GUI https://github.com/edre/nokamute

I just hacked up a wasm build of nokamute that communicates over UHP. Here are the files and here is my dumb example. Let me know if this is useful at all.