3 ms·
On the grid graph comparison of how different algorithms perform on different games, two questions: 1) What is the source data for that plot? 2) You specify "
by daveguy 10y ago
On the grid graph comparison of how different algorithms perform on different games, two questions:
1) What is the source data for that plot?
2) You specify "lighter = better", but how are they normalized across games and algorithms? How is better and worse quantified to get a "lightness"?
Edit: Found #2 in the second paper. Still don't know what 25 wins is white and 0 wins is black means? How do you "win" some of these?
Two papers are here:
http://julian.togelius.com/Mendes2016HyperHeuristic.pdf http://julian.togelius.com/Mendes2016HyperHeuristic.pdf
http://julian.togelius.com/Bontrager2016Matching.pdf http://julian.togelius.com/Bontrager2016Matching.pdf
- togelius 10y agoThe source of data is a lot of simulations we ran ourselves. All of the games can be won or lost - there's also a score measure as well, but that was not used in producing that graphic.
- daveguy 10y agoSo something like digdug being black means that no algorithm has progressed through all levels to completely beat the game? That seems like a high bar to set for a "win".