Skip to main content


The posts below follow the development of the Typescript / Javascript library I created that implements the minimax / negamax algorithm. Aside from just the fundamental algorithm, it also features:

  • Generic design for use with any game
  • Iterative deepening
  • Time-limited searches
  • Alpha-beta pruning
  • Node presorting for better pruning
  • Generator based node creation for reduced memory and faster searches

Coming soon:

  • Support for games with more than 2 players
  • Weighted random selection of best moves
  • Probability in the game tree (dice rolls etc)

Minimaxer #