Playing against a machine: minimax and alpha-beta pruning
How a machine that never loses plays: minimax assumes the opponent's worst and alpha-beta pruning gives the same move by looking at less. AI course, 0.6.
Code
Inside articles there are more settings: width, font size, series position and code.
Saved in this browser.
How a machine that never loses plays: minimax assumes the opponent's worst and alpha-beta pruning gives the same move by looking at less. AI course, 0.6.
How an AI finds a path without learning: breadth-first, depth-first, uniform cost, greedy and A*, step by step on a grid. AI course, 0.5.