Minimaxer Part 4 - Code optimisation
Making minimax run Blazingly Fast ™ with generators, faster loops and smarter sorting.
Minimaxer
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 #
Minimaxer Part 3 - Implementing an AI player and benchmarking
·7 mins
Implementing the game mancala, building a minimax AI player and seeing how different configurations perform.
Minimaxer Part 2 - Alpha-beta pruning and iterative deepening
·10 mins
Improving on the minimax algorithm with alpha-beta pruning, iterative deepening, time-based searches and more.
Minimaxer Part 1 - Building a minimax library in Typescript
·11 mins
Creating a typescript/javascript library that implements the minimax algorithm.