aboutsummaryrefslogtreecommitdiffstats
path: root/OLD/csci4511w/writing4.bib
blob: 974b1befa001aca122341f2d2d5573cd4396afd1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
@book{GeneralGame,
  AUTHOR    = {Goldwaser, A. and Thielscher, M.},
  PUBLISHER = {University of New South Wales},
  TITLE     = {Deep Reinforcement Learning for General Game Playing},
  URL       = {https://ojs.aaai.org//index.php/AAAI/article/view/5533},
  YEAR      = {April 3 2020}
}
@book{MCTS,
  AUTHOR    = {Chaslot, G. and Bakkes, S. and Szita, I. and Spronck, P.},
  PUBLISHER = {Universiteit Maastricht / MICC},
  TITLE     = {Monte-Carlo Tree Search: A New Framework for Game AI},
  URL       = {https://www.aaai.org/Papers/AIIDE/2008/AIIDE08-036.pdf},
  YEAR      = {2008}
}
@book{Minimax,
  AUTHOR    = {Kang, X. and Wang, Y. and Yanrui, H.},
  PUBLISHER = {Dalian Polytechnic University},
  TITLE     = {Research on Different Heuristics for Minimax Algorithm Insight from Connect-4 Game},
  URL       = {https://www.scirp.org/pdf/JILSA_2019030615385424.pdf},
  YEAR      = {March 4 2019}
}
@inproceedings{IEEE2015,
  AUTHOR    = {Y. {Zhuang} and S. {Li} and T. V. {Peters} and C. {Zhang}},
  BOOKTITLE = {2015 IEEE Conference on Computational Intelligence and Games (CIG)},
  DOI       = {10.1109/CIG.2015.7317912},
  NUMBER    = {},
  PAGES     = {314-321},
  TITLE     = {Improving Monte-Carlo tree search for dots-and-boxes with a novel board representation and artificial neural networks},
  VOLUME    = {},
  YEAR      = {2015}
}
@article{Cornell1998,
  author    = {Lex Weaver and
               Terry Bossomaier},
  title     = {Evolution of Neural Networks to Play the Game of Dots-and-Boxes},
  journal   = {CoRR},
  volume    = {cs.NE/9809111},
  year      = {1998},
  url       = {https://arxiv.org/abs/cs/9809111},
  timestamp = {Fri, 10 Jan 2020 12:58:53 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/cs-NE-9809111.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{Barker_Korf_2012,
  author={Barker, Joseph and Korf, Richard}, 
  title = {Solving Dots-And-Boxes}, 
  volume = {26}, 
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/8144},
  number = {1},
  journal={Proceedings of the AAAI Conference on Artificial Intelligence}, 
  year={2012}, 
  month={July} 
}
@inproceedings{berlekamp2000,
  AUTHOR    = {Berlekamp, Elwyn and Scott, Katherine},
  BOOKTITLE = {More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games},
  PAGES     = {317--330},
  TITLE     = {Forcing your opponent to stay in control of a loony dots-and-boxes endgame},
  YEAR      = {2000}
}
@misc{buzzard2014,
  ARCHIVEPREFIX = {arXiv},
  AUTHOR        = {Kevin Buzzard and Michael Ciere},
  EPRINT        = {1305.2156},
  PRIMARYCLASS  = {math.CO},
  TITLE         = {Playing simple loony dots and boxes endgames optimally},
  YEAR          = {2014}
}
@misc{allcock2019best,
  ARCHIVEPREFIX = {arXiv},
  AUTHOR        = {Daniel Allcock},
  EPRINT        = {1811.10747},
  PRIMARYCLASS  = {math.CO},
  TITLE         = {Best play in Dots and Boxes endgames},
  YEAR          = {2019}
}
 @misc{wlson_2002,
  AUTHOR  = {Wlson, David},
  JOURNAL = {Dots-and-Boxes Analysis Index},
  URL     = {https://wilson.engr.wisc.edu/boxes/},
  YEAR    = {2002}
}