Timeline for Assuming an infinite amount of computing resources, would the minmax algorithm always win in chess?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2019 at 12:25 | vote | accept | olinarr | ||
| Jul 22, 2019 at 16:19 | answer | added | Gilles 'SO- stop being evil' | timeline score: 2 | |
| Jul 22, 2019 at 16:19 | comment | added | olinarr | @Discrete lizard thank you. This will definetely help a lot. | |
| Jul 22, 2019 at 16:18 | comment | added | Discrete lizard♦ | @Gilles The main reason I mentioned the theorem is that I vaguely recalled a proof that relies on the same alternating structure as minimax. I'm not sure, but I thought it was related, at least. | |
| Jul 22, 2019 at 16:16 | comment | added | Discrete lizard♦ | @Gilles Well, according to my WP page I linked, there are in fact multiple versions of Zermelo's theorem, of which some include 'draw', and apparently can be applied to chess. I think I got introduced to the version with a draw, but it is possible that the original theorem only has 'win' or 'loss' as a condition. | |
| Jul 22, 2019 at 16:10 | comment | added | Gilles 'SO- stop being evil' | @Discretelizard Why would Zermelo's theorem be needed? It doesn't apply to chess anyway, since chess has draws. | |
| Jul 22, 2019 at 14:58 | comment | added | Discrete lizard♦ | It might be useful to look at this problem with simpler games, such as tic-tac-toe. Can we force a win with infinite resources in that game? I think you can get a formal proof that minimax reaches the 'best' outcome in any 2 player perfect information game 'for free' with the proof of Zermelo's theorem, so looking there may help. | |
| Jul 21, 2019 at 21:21 | answer | added | gnasher729 | timeline score: -1 | |
| Jul 21, 2019 at 20:41 | history | asked | olinarr | CC BY-SA 4.0 |