Timeline for answer to What is the optimal algorithm for the game 2048? by Khaled.K
Current License: CC BY-SA 3.0
Post Revisions
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2015 at 9:12 | comment | added | Khaled.K | @bcdan the heuristic (aka comparison-score) depends on comparing the expected value of future state, similar to how chess heuristics work, except this is a linear heuristic, since we don't build a tree to know the best next N moves | |
| Jun 23, 2015 at 23:45 | comment | added | bcdan |
Why do you need a constant? If all you are doing is comparing scores, how does that affect the outcome of those comparisons?
|
|
| Apr 2, 2014 at 11:44 | audit | First posts | |||
| Apr 2, 2014 at 11:45 | |||||
| Mar 15, 2014 at 6:17 | comment | added | cegprakash | What is the win% of this algorithm? | |
| Mar 12, 2014 at 20:30 | history | edited | Khaled.K | CC BY-SA 3.0 |
added 749 characters in body
|
| Mar 12, 2014 at 20:15 | history | answered | Khaled.K | CC BY-SA 3.0 |