83
Βιβλιογραφία
[1]
Moody Rebecca, “Screen Time Statistics: Average Screen Time in US vs. the Rest of the
World.,” Comparitech, 2022. https://www.comparitech.com/tv-streaming/screen-time-
statistics/ (accessed Jun. 17, 2022).
[2]
J. Juul, “The repeatedly lost art of studying games,” Game Studies, vol. 1, no. 1, 2001.
[3]
M. Newborn, Kasparov versus Deep Blue: Computer chess comes of age. Springer Science &
Business Media, 2012.
[4]
D. A. Ferrucci, “Introduction to ‘this is watson,’” IBM Journal of Research and Development,
vol. 56, no. 3.4, p. 1, 2012.
[5]
V. Mnih et al., “Playing atari with deep reinforcement learning,” arXiv preprint
arXiv:1312.5602, 2013.
[6]
“AlphaGO,” DeepMind. https://www.deepmind.com/research/highlighted-research/. (accessed
Jun. 17, 2022).
[7]
“OpenAI Five,” OpenAI Five. https://openai.com/five/ (accessed Jun. 17, 2022).
[8]
O. Vinyals et al., “Grandmaster level in StarCraft II using multi-agent reinforcement learning,”
Nature, vol. 575, no. 7782, pp. 350–354, 2019.
[9]
B. Shestakofsky, “Working algorithms: Software automation and the future of work,” Work
and Occupations, vol. 44, no. 4, pp. 376–423, 2017.
[10]
Kaye R, “Minesweeper is NP-Complete,” 2000.
[11]
I. Stewart, “Million-Dollar Minesweeper,” 2000. [Online]. Available:
http://www.minesweeper.info/articles/
[12]
R. Kaye, “Infinite versions of minesweeper are Turing complete,” 2000. [Online]. Available:
http://www.mat.bham.ac.uk/R.W.Kaye
[13]
K. Pedersen, “The complexity of Minesweeper and strategies for game playing,” 2003.
[14]
M. de Bondt, “The computational complexity of Minesweeper,” Apr. 2012, [Online].
Available: http://arxiv.org/abs/1204.4659
[15]
A. Adamatzky, “How Cellular Automaton Plays Minesweeper,” 1985.
[16]
D. Kamenetsky and C. H. Teo, “Graphical Models for Minesweeper Project Report,” 2007.
[17]
S. Golan, “Minesweeper on graphs,” Appl Math Comput, vol. 217, no. 14, pp. 6616–6623,
2011.
[18]
P. Nakov and Z. Wei, “MINESWEEPER, #MINESWEEPER,” 2003.