How this channel uses the term A local maximum is a solution that is better than every nearby alternative, yet is not the best solution overall — the global maximum. In optimization and AI, a system that climbs toward better and better results can get stuck on a local maximum because every small step away makes things temporarily worse, even though a far better configuration exists elsewhere in the space. Why it matters in games and AI In the context of evaluating and training models in game environments — such as teaching AI to play Diplomacy, which became the seed of a multi-million-dollar startup — local maxima are a key pitfall: a strategy that looks optimal against immediate opponents or nearby variations may still fall well short of the best achievable play [^01a0f15a-d881-7a49-9531-148c764e2dcd@0]. Games are rich testing grounds precisely because they expose whether a model has settled into a merely good-enough pattern or can keep exploring beyond it [^01a0f15a-d881-7a49-9531-148c764e2dcd@874] [^01a0f15a-d881-7a49-9531-148c764e2dcd@935]. <KeyPoint>A local maximum beats all its neighbors but is not the overall best outcome.</KeyPoint> <KeyPoint>Optimization processes can get stuck there because improvement requires a temporary step downhill.</KeyPoint> <KeyPoint>Game environments like Diplomacy help reveal when a model's strategy is merely a local peak.</KeyPoint>