Re: [math-fun] Game Theory/Chess strategy question

For chess, each possible move leads to a win, loss, or tie. Since there are usually many more than 3 moves available, the best move is usually not unique. Among the moves in each equivalence class, some might be characterized by us as more or less aggressive. Game theory doesn't have a category of better or worse winning moves, but human analyzers might have other ideas. Working on the AIs for my robots, I frequently have to tweak them so (for example) they will win a game in as few moves as possible, or avoid making obviously stupid "giveaway" moves in a game they see as inevitably lost.