Timeline for Playing video games to solve SAT instances
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22, 2020 at 2:08 | vote | accept | Erel Segal-Halevi | ||
| Sep 23, 2020 at 19:53 | answer | added | Criticizing Israel not allowed | timeline score: 3 | |
| Sep 21, 2020 at 17:49 | answer | added | Kyle Jones | timeline score: 1 | |
| Sep 21, 2020 at 14:40 | comment | added | Erel Segal-Halevi | @Dmitry Actually, there are video games that have been used to solve some hard computational problems: arstechnica.com/gaming/2017/07/… (I do not know if it is relevant for general SAT instances). | |
| Sep 21, 2020 at 13:29 | comment | added | Yuval Filmus | You are essentially asking whether NP=coNP, which is conjectured to be false. | |
| Sep 21, 2020 at 10:09 | comment | added | user114966 | I think that this is very dubious. I've read that experienced chess players can easily remember positions of figures if they are taken from a real game and can't do this nearly this well when figures are placed randomly. I.e. their experience helps them in "natural" situations and doesn't help at all in non-natural ones. And I expect that Mario levels generated from SAT are anything but natural. SAT solvers will probably do a better job. | |
| Sep 21, 2020 at 9:19 | history | asked | Erel Segal-Halevi | CC BY-SA 4.0 |