Adds a .bib export file
This commit is contained in:
parent
690b2e33c6
commit
397b6656cd
|
|
@ -6,6 +6,8 @@ should be of interest to anyone interested in boardgames and their optimal play.
|
|||
Chess and Go, finding prior work on more contemporary games can be a bit hard. This list focuses on the latter. If you are interested in well-researched
|
||||
games like Chess, Go, Hex, take a look at the [Chess programming wiki](https://www.chessprogramming.org/Games) instead. The list also covers some computer-games that fall under similar themes.
|
||||
|
||||
A [work-in-progress BibTeX file is available as well](boardgame-research.bib), which you can easily import.
|
||||
|
||||
If you aren't able to access any paper on this list, please [try using Sci-Hub](https://en.m.wikipedia.org/wiki/Sci-Hub) or [reach out to me](https://captnemo.in/contact/).
|
||||
|
||||
<!-- START doctoc generated TOC please keep comment here to allow auto update -->
|
||||
|
|
@ -53,7 +55,7 @@ If you aren't able to access any paper on this list, please [try using Sci-Hub](
|
|||
- [Game strategies for The Settlers of Catan](https://doi.org/10.1109/CIG.2014.6932884)
|
||||
- [Monte-Carlo Tree Search in Settlers of Catan](https://doi.org/10.1007/978-3-642-12993-3_3)
|
||||
- [Settlers of Catan bot trained using reinforcement learning (MATLAB).](https://jonzia.github.io/Catan/)
|
||||
- [Trading in a multiplayer board game:Towards an analysis of non-cooperative dialogue](https://escholarship.org/content/qt9zt506xx/qt9zt506xx.pdf)
|
||||
- [Trading in a multiplayer board game: Towards an analysis of non-cooperative dialogue](https://escholarship.org/content/qt9zt506xx/qt9zt506xx.pdf)
|
||||
- [POMCP with Human Preferencesin Settlers of Catan](https://www.aaai.org/ocs/index.php/AIIDE/AIIDE18/paper/viewFile/18091/17217)
|
||||
- [Reinforcement Learning of Strategies for Settlers of Catan](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.561.6293&rep=rep1&type=pdf)
|
||||
- [Deep Reinforcement Learning in Strategic Board GameEnvironments](https://doi.org/10.1007/978-3-030-14174-5_16) [[pdf](https://hal.archives-ouvertes.fr/hal-02124411/document)]
|
||||
|
|
@ -70,7 +72,7 @@ If you aren't able to access any paper on this list, please [try using Sci-Hub](
|
|||
|
||||
# Risk
|
||||
- [Mini-Risk: Strategies for a Simplified Board Game](https://doi.org/10.1057/jors.1990.2)
|
||||
- [A Multi-Agent System for playing theboard game Risk](https://www.diva-portal.org/smash/record.jsf?pid=diva2%3A831093&dswid=-4740)
|
||||
- [A Multi-Agent System for playing the board game Risk](https://www.diva-portal.org/smash/record.jsf?pid=diva2%3A831093&dswid=-4740)
|
||||
- [Learning the risk board game with classifier systems](https://doi.org/10.1145/508791.508904)
|
||||
- [Markov Chains and the RISK Board Game](https://doi.org/10.1080/0025570X.1997.11996573)
|
||||
- [Markov Chains for the RISK Board Game Revisited](https://doi.org/10.1080/0025570X.2003.11953165)
|
||||
|
|
|
|||
|
|
@ -0,0 +1,753 @@
|
|||
|
||||
@inproceedings{guhe_effectiveness_2014,
|
||||
address = {Dortmund, Germany},
|
||||
title = {The effectiveness of persuasion in {The} {Settlers} of {Catan}},
|
||||
isbn = {978-1-4799-3547-5},
|
||||
url = {http://ieeexplore.ieee.org/document/6932861/},
|
||||
doi = {10.1109/CIG.2014.6932861},
|
||||
urldate = {2020-07-20},
|
||||
booktitle = {2014 {IEEE} {Conference} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Guhe, Markus and Lascarides, Alex},
|
||||
month = aug,
|
||||
year = {2014},
|
||||
pages = {1--8},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/ITK52TEL/Guhe and Lascarides - 2014 - The effectiveness of persuasion in The Settlers of.pdf:application/pdf;Submitted Version:/home/nemo/Zotero/storage/HTNFAWSA/Guhe and Lascarides - 2014 - The effectiveness of persuasion in The Settlers of.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{guhe_effectiveness_2014-1,
|
||||
title = {The effectiveness of persuasion in {The} {Settlers} of {Catan}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2014.6932861},
|
||||
doi = {10.1109/cig.2014.6932861},
|
||||
booktitle = {2014 {IEEE} {Conference} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Guhe, Markus and Lascarides, Alex},
|
||||
month = aug,
|
||||
year = {2014},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/WJWTC8A9/Guhe and Lascarides - 2014 - The effectiveness of persuasion in The Settlers of.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{boda_avoiding_2018,
|
||||
title = {Avoiding {Revenge} {Using} {Optimal} {Opponent} {Ranking} {Strategy} in the {Board} {Game} {Catan}},
|
||||
volume = {10},
|
||||
url = {https://doi.org/10.4018%2Fijgcms.2018040103},
|
||||
doi = {10.4018/ijgcms.2018040103},
|
||||
number = {2},
|
||||
journal = {International Journal of Gaming and Computer-Mediated Simulations},
|
||||
author = {Boda, Márton Attila},
|
||||
month = apr,
|
||||
year = {2018},
|
||||
note = {Publisher: IGI Global},
|
||||
pages = {47--70},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/C8XZ64B8/Boda - 2018 - Avoiding Revenge Using Optimal Opponent Ranking St.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{guhe_game_2014,
|
||||
title = {Game strategies for {The} {Settlers} of {Catan}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2014.6932884},
|
||||
doi = {10.1109/cig.2014.6932884},
|
||||
booktitle = {2014 {IEEE} {Conference} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Guhe, Markus and Lascarides, Alex},
|
||||
month = aug,
|
||||
year = {2014},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/E7ARZVSI/Guhe and Lascarides - 2014 - Game strategies for The Settlers of Catan.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{szita_monte-carlo_2010,
|
||||
title = {Monte-{Carlo} {Tree} {Search} in {Settlers} of {Catan}},
|
||||
url = {https://doi.org/10.1007%2F978-3-642-12993-3_3},
|
||||
booktitle = {Lecture {Notes} in {Computer} {Science}},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
author = {Szita, István and Chaslot, Guillaume and Spronck, Pieter},
|
||||
year = {2010},
|
||||
doi = {10.1007/978-3-642-12993-3_3},
|
||||
pages = {21--32},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/T5DQM5GD/Szita et al. - 2010 - Monte-Carlo Tree Search in Settlers of Catan.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{xenou_deep_2019,
|
||||
title = {Deep {Reinforcement} {Learning} in {Strategic} {Board} {Game} {Environments}},
|
||||
url = {https://doi.org/10.1007%2F978-3-030-14174-5_16},
|
||||
booktitle = {Multi-{Agent} {Systems}},
|
||||
publisher = {Springer International Publishing},
|
||||
author = {Xenou, Konstantia and Chalkiadakis, Georgios and Afantenos, Stergos},
|
||||
year = {2019},
|
||||
doi = {10.1007/978-3-030-14174-5_16},
|
||||
pages = {233--248},
|
||||
file = {Accepted Version:/home/nemo/Zotero/storage/MXL35B77/Xenou et al. - 2019 - Deep Reinforcement Learning in Strategic Board Gam.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{maliphant_mini-risk_1990,
|
||||
title = {Mini-{Risk}: {Strategies} for a {Simplified} {Board} {Game}},
|
||||
volume = {41},
|
||||
url = {https://doi.org/10.1057%2Fjors.1990.2},
|
||||
doi = {10.1057/jors.1990.2},
|
||||
number = {1},
|
||||
journal = {Journal of the Operational Research Society},
|
||||
author = {Maliphant, Sarah A. and Smith, David K.},
|
||||
month = jan,
|
||||
year = {1990},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {9--16},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/X6ZHBQT8/Maliphant and Smith - 1990 - Mini-Risk Strategies for a Simplified Board Game.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{neves_learning_2002,
|
||||
title = {Learning the risk board game with classifier systems},
|
||||
url = {https://doi.org/10.1145%2F508791.508904},
|
||||
doi = {10.1145/508791.508904},
|
||||
booktitle = {Proceedings of the 2002 {ACM} symposium on {Applied} computing - {SAC} {\textbackslash}textquotesingle02},
|
||||
publisher = {ACM Press},
|
||||
author = {Neves, Atila and Brasāo, Osvaldo and Rosa, Agostinho},
|
||||
year = {2002},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/V8H6XI4Y/Neves et al. - 2002 - Learning the risk board game with classifier syste.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{tan_markov_1997,
|
||||
title = {Markov {Chains} and the {RISK} {Board} {Game}},
|
||||
volume = {70},
|
||||
url = {https://doi.org/10.1080%2F0025570x.1997.11996573},
|
||||
doi = {10.1080/0025570x.1997.11996573},
|
||||
number = {5},
|
||||
journal = {Mathematics Magazine},
|
||||
author = {Tan, Bariş},
|
||||
month = dec,
|
||||
year = {1997},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {349--357},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/ZS9TP9BZ/Tan - 1997 - Markov Chains and the RISK Board Game.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{osborne_markov_2003,
|
||||
title = {Markov {Chains} for the {RISK} {Board} {Game} {Revisited}},
|
||||
volume = {76},
|
||||
url = {https://doi.org/10.1080%2F0025570x.2003.11953165},
|
||||
doi = {10.1080/0025570x.2003.11953165},
|
||||
number = {2},
|
||||
journal = {Mathematics Magazine},
|
||||
author = {Osborne, Jason A.},
|
||||
month = apr,
|
||||
year = {2003},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {129--135},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/FI6LTX8L/Osborne - 2003 - Markov Chains for the RISK Board Game Revisited.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{vaccaro_planning_2005,
|
||||
title = {Planning an {Endgame} {Move} {Set} for the {Game} {RISK}: {A} {Comparison} of {Search} {Algorithms}},
|
||||
volume = {9},
|
||||
url = {https://doi.org/10.1109%2Ftevc.2005.856211},
|
||||
doi = {10.1109/tevc.2005.856211},
|
||||
number = {6},
|
||||
journal = {IEEE Trans. Evol. Computat.},
|
||||
author = {Vaccaro, J. M. and Guest, C. C.},
|
||||
month = dec,
|
||||
year = {2005},
|
||||
note = {Publisher: Institute of Electrical and Electronics Engineers (IEEE)},
|
||||
pages = {641--652},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/8Q7W86Z4/Vaccaro and Guest - 2005 - Planning an Endgame Move Set for the Game RISK A .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{gedda_monte_2018,
|
||||
title = {Monte {Carlo} {Methods} for the {Game} {Kingdomino}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2018.8490419},
|
||||
doi = {10.1109/cig.2018.8490419},
|
||||
booktitle = {2018 {IEEE} {Conference} on {Computational} {Intelligence} and {Games} ({CIG})},
|
||||
publisher = {IEEE},
|
||||
author = {Gedda, Magnus and Lagerkvist, Mikael Z. and Butler, Martin},
|
||||
month = aug,
|
||||
year = {2018},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/BKV7VG59/Gedda et al. - 2018 - Monte Carlo Methods for the Game Kingdomino.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{cox_how_2015,
|
||||
title = {How to {Make} the {Perfect} {Fireworks} {Display}: {Two} {Strategies} {forHanabi}},
|
||||
volume = {88},
|
||||
url = {https://doi.org/10.4169%2Fmath.mag.88.5.323},
|
||||
doi = {10.4169/math.mag.88.5.323},
|
||||
number = {5},
|
||||
journal = {Mathematics Magazine},
|
||||
author = {Cox, Christopher and Silva, Jessica De and Deorsey, Philip and Kenter, Franklin H. J. and Retter, Troy and Tobin, Josh},
|
||||
month = dec,
|
||||
year = {2015},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {323--336},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/E7PR5FAI/Cox et al. - 2015 - How to Make the Perfect Fireworks Display Two Str.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{walton-rivers_evaluating_2017,
|
||||
title = {Evaluating and modelling {Hanabi}-playing agents},
|
||||
url = {https://doi.org/10.1109%2Fcec.2017.7969465},
|
||||
doi = {10.1109/cec.2017.7969465},
|
||||
booktitle = {2017 {IEEE} {Congress} on {Evolutionary} {Computation} ({CEC})},
|
||||
publisher = {IEEE},
|
||||
author = {Walton-Rivers, Joseph and Williams, Piers R. and Bartle, Richard and Perez-Liebana, Diego and Lucas, Simon M.},
|
||||
month = jun,
|
||||
year = {2017},
|
||||
file = {Accepted Version:/home/nemo/Zotero/storage/6LVCR5LJ/Walton-Rivers et al. - 2017 - Evaluating and modelling Hanabi-playing agents.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{bard_hanabi_2020,
|
||||
title = {The {Hanabi} challenge: {A} new frontier for {AI} research},
|
||||
volume = {280},
|
||||
url = {https://doi.org/10.1016%2Fj.artint.2019.103216},
|
||||
doi = {10.1016/j.artint.2019.103216},
|
||||
journal = {Artificial Intelligence},
|
||||
author = {Bard, Nolan and Foerster, Jakob N. and Chandar, Sarath and Burch, Neil and Lanctot, Marc and Song, H. Francis and Parisotto, Emilio and Dumoulin, Vincent and Moitra, Subhodeep and Hughes, Edward and Dunning, Iain and Mourad, Shibl and Larochelle, Hugo and Bellemare, Marc G. and Bowling, Michael},
|
||||
month = mar,
|
||||
year = {2020},
|
||||
note = {Publisher: Elsevier BV},
|
||||
pages = {103216},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/QK4PLTNC/Bard et al. - 2020 - The Hanabi challenge A new frontier for AI resear.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{walton-rivers_2018_2019,
|
||||
title = {The 2018 {Hanabi} competition},
|
||||
url = {https://doi.org/10.1109%2Fcig.2019.8848008},
|
||||
doi = {10.1109/cig.2019.8848008},
|
||||
booktitle = {2019 {IEEE} {Conference} on {Games} ({CoG})},
|
||||
publisher = {IEEE},
|
||||
author = {Walton-Rivers, Joseph and Williams, Piers R. and Bartle, Richard},
|
||||
month = aug,
|
||||
year = {2019},
|
||||
file = {Accepted Version:/home/nemo/Zotero/storage/EG5MFSFH/Walton-Rivers et al. - 2019 - The 2018 Hanabi competition.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{canaan_diverse_2019,
|
||||
title = {Diverse {Agents} for {Ad}-{Hoc} {Cooperation} in {Hanabi}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2019.8847944},
|
||||
doi = {10.1109/cig.2019.8847944},
|
||||
booktitle = {2019 {IEEE} {Conference} on {Games} ({CoG})},
|
||||
publisher = {IEEE},
|
||||
author = {Canaan, Rodrigo and Togelius, Julian and Nealen, Andy and Menzel, Stefan},
|
||||
month = aug,
|
||||
year = {2019},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/9WT5YA3E/Canaan et al. - 2019 - Diverse Agents for Ad-Hoc Cooperation in Hanabi.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{ash_monopoly_1972,
|
||||
title = {Monopoly as a {Markov} {Process}},
|
||||
volume = {45},
|
||||
url = {https://doi.org/10.1080%2F0025570x.1972.11976187},
|
||||
doi = {10.1080/0025570x.1972.11976187},
|
||||
number = {1},
|
||||
journal = {Mathematics Magazine},
|
||||
author = {Ash, Robert B. and Bishop, Richard L.},
|
||||
month = jan,
|
||||
year = {1972},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {26--29},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/KZZXN75I/Ash and Bishop - 1972 - Monopoly as a Markov Process.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{cowling_ensemble_2012,
|
||||
title = {Ensemble {Determinization} in {Monte} {Carlo} {Tree} {Search} for the {Imperfect} {Information} {Card} {Game} {Magic}: {The} {Gathering}},
|
||||
volume = {4},
|
||||
url = {https://doi.org/10.1109%2Ftciaig.2012.2204883},
|
||||
doi = {10.1109/tciaig.2012.2204883},
|
||||
number = {4},
|
||||
journal = {IEEE Trans. Comput. Intell. AI Games},
|
||||
author = {Cowling, Peter I. and Ward, Colin D. and Powley, Edward J.},
|
||||
month = dec,
|
||||
year = {2012},
|
||||
note = {Publisher: Institute of Electrical and Electronics Engineers (IEEE)},
|
||||
pages = {241--257},
|
||||
file = {Accepted Version:/home/nemo/Zotero/storage/JI5MQ857/Cowling et al. - 2012 - Ensemble Determinization in Monte Carlo Tree Searc.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{bosch_optimal_2000,
|
||||
title = {Optimal {Card}-{Collecting} {Strategies} for {Magic}: {The} {Gathering}},
|
||||
volume = {31},
|
||||
url = {https://doi.org/10.1080%2F07468342.2000.11974103},
|
||||
doi = {10.1080/07468342.2000.11974103},
|
||||
number = {1},
|
||||
journal = {The College Mathematics Journal},
|
||||
author = {Bosch, Robert A.},
|
||||
month = jan,
|
||||
year = {2000},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {15--21},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/A6L5BUGS/Bosch - 2000 - Optimal Card-Collecting Strategies for Magic The .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{ward_monte_2009,
|
||||
title = {Monte {Carlo} search applied to card selection in {Magic}: {The} {Gathering}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2009.5286501},
|
||||
doi = {10.1109/cig.2009.5286501},
|
||||
booktitle = {2009 {IEEE} {Symposium} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Ward, C. D. and Cowling, P. I.},
|
||||
month = sep,
|
||||
year = {2009},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/GR28QUPQ/Ward and Cowling - 2009 - Monte Carlo search applied to card selection in Ma.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{silva_evolving_2018,
|
||||
title = {Evolving maps and decks for ticket to ride},
|
||||
url = {https://doi.org/10.1145%2F3235765.3235813},
|
||||
doi = {10.1145/3235765.3235813},
|
||||
booktitle = {Proceedings of the 13th {International} {Conference} on the {Foundations} of {Digital} {Games}},
|
||||
publisher = {ACM},
|
||||
author = {Silva, Fernando de Mesentier and Lee, Scott and Togelius, Julian and Nealen, Andy},
|
||||
month = aug,
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/4YHG74J5/Silva et al. - 2018 - Evolving maps and decks for ticket to ride.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{demaine_is_2010,
|
||||
title = {{UNO} {Is} {Hard}, {Even} for a {Single} {Player}},
|
||||
url = {https://doi.org/10.1007%2F978-3-642-13122-6_15},
|
||||
booktitle = {Lecture {Notes} in {Computer} {Science}},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
author = {Demaine, Erik D. and Demaine, Martin L. and Uehara, Ryuhei and Uno, Takeaki and Uno, Yushi},
|
||||
year = {2010},
|
||||
doi = {10.1007/978-3-642-13122-6_15},
|
||||
pages = {133--144},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/75SB8JSY/Demaine et al. - 2010 - UNO Is Hard, Even for a Single Player.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{mishiba_quixo_2020,
|
||||
title = {{QUIXO} is {EXPTIME}-complete},
|
||||
url = {https://doi.org/10.1016%2Fj.ipl.2020.105995},
|
||||
doi = {10.1016/j.ipl.2020.105995},
|
||||
journal = {Information Processing Letters},
|
||||
author = {Mishiba, Shohei and Takenaga, Yasuhiko},
|
||||
month = jul,
|
||||
year = {2020},
|
||||
note = {Publisher: Elsevier BV},
|
||||
pages = {105995},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/I6S8CB93/Mishiba and Takenaga - 2020 - QUIXO is EXPTIME-complete.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{woolford_scout_2017,
|
||||
title = {{SCOUT}: {A} {Case}-{Based} {Reasoning} {Agent} for {Playing} {Race} for the {Galaxy}},
|
||||
url = {https://doi.org/10.1007%2F978-3-319-61030-6_27},
|
||||
booktitle = {Case-{Based} {Reasoning} {Research} and {Development}},
|
||||
publisher = {Springer International Publishing},
|
||||
author = {Woolford, Michael and Watson, Ian},
|
||||
year = {2017},
|
||||
doi = {10.1007/978-3-319-61030-6_27},
|
||||
pages = {390--402}
|
||||
}
|
||||
|
||||
@article{coleman_game_2012,
|
||||
title = {Game, {Set}, {Math}},
|
||||
volume = {85},
|
||||
url = {https://doi.org/10.4169%2Fmath.mag.85.2.083},
|
||||
doi = {10.4169/math.mag.85.2.083},
|
||||
number = {2},
|
||||
journal = {Mathematics Magazine},
|
||||
author = {Coleman, Ben and Hartshorn, Kevin},
|
||||
month = apr,
|
||||
year = {2012},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {83--96},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/UZL88CQ4/Coleman and Hartshorn - 2012 - Game, Set, Math.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{glass_joy_2018,
|
||||
title = {The {Joy} of {SET}},
|
||||
volume = {125},
|
||||
url = {https://doi.org/10.1080%2F00029890.2018.1412661},
|
||||
doi = {10.1080/00029890.2018.1412661},
|
||||
number = {3},
|
||||
journal = {The American Mathematical Monthly},
|
||||
author = {Glass, Darren},
|
||||
month = feb,
|
||||
year = {2018},
|
||||
note = {Publisher: Informa UK Limited},
|
||||
pages = {284--288},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/ID46MICU/Glass - 2018 - The Joy of SET.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{lazarusli_implementation_2015,
|
||||
title = {Implementation of {Artificial} {Intelligence} with 3 {Different} {Characters} of {AI} {Player} on “{Monopoly} {Deal}” {Computer} {Game}},
|
||||
url = {https://doi.org/10.1007%2F978-3-662-46742-8_11},
|
||||
booktitle = {Communications in {Computer} and {Information} {Science}},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
author = {Lazarusli, Irene A. and Lukas, Samuel and Widjaja, Patrick},
|
||||
year = {2015},
|
||||
doi = {10.1007/978-3-662-46742-8_11},
|
||||
pages = {119--127}
|
||||
}
|
||||
|
||||
@incollection{pawlewicz_nearly_2011,
|
||||
title = {Nearly {Optimal} {Computer} {Play} in {Multi}-player {Yahtzee}},
|
||||
url = {https://doi.org/10.1007%2F978-3-642-17928-0_23},
|
||||
booktitle = {Computers and {Games}},
|
||||
publisher = {Springer Berlin Heidelberg},
|
||||
author = {Pawlewicz, Jakub},
|
||||
year = {2011},
|
||||
doi = {10.1007/978-3-642-17928-0_23},
|
||||
pages = {250--262}
|
||||
}
|
||||
|
||||
@inproceedings{glenn_computer_2007,
|
||||
title = {Computer {Strategies} for {Solitaire} {Yahtzee}},
|
||||
url = {https://doi.org/10.1109%2Fcig.2007.368089},
|
||||
doi = {10.1109/cig.2007.368089},
|
||||
booktitle = {2007 {IEEE} {Symposium} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Glenn, James R.},
|
||||
year = {2007},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/GPCGB5MW/Glenn - 2007 - Computer Strategies for Solitaire Yahtzee.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{maynard_modeling_2001,
|
||||
title = {Modeling expert problem solving in a game of chance: a {Yahtzeec} case study},
|
||||
volume = {18},
|
||||
url = {https://doi.org/10.1111%2F1468-0394.00160},
|
||||
doi = {10.1111/1468-0394.00160},
|
||||
number = {2},
|
||||
journal = {Expert Systems},
|
||||
author = {Maynard, Ken and Moss, Patrick and Whitehead, Marcus and Narayanan, S. and Garay, Matt and Brannon, Nathan and Kantamneni, Raj Gopal and Kustra, Todd},
|
||||
month = may,
|
||||
year = {2001},
|
||||
note = {Publisher: Wiley},
|
||||
pages = {88--98},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/PG6NUX5X/Maynard et al. - 2001 - Modeling expert problem solving in a game of chanc.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@incollection{oka_systematic_2016,
|
||||
title = {Systematic {Selection} of {N}-{Tuple} {Networks} for 2048},
|
||||
url = {https://doi.org/10.1007%2F978-3-319-50935-8_8},
|
||||
booktitle = {Computers and {Games}},
|
||||
publisher = {Springer International Publishing},
|
||||
author = {Oka, Kazuto and Matsuzaki, Kiminori},
|
||||
year = {2016},
|
||||
doi = {10.1007/978-3-319-50935-8_8},
|
||||
pages = {81--92},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/DAJB4HAP/Oka and Matsuzaki - 2016 - Systematic Selection of N-Tuple Networks for 2048.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{matsuzaki_systematic_2016,
|
||||
title = {Systematic selection of {N}-tuple networks with consideration of interinfluence for game 2048},
|
||||
url = {https://doi.org/10.1109%2Ftaai.2016.7880154},
|
||||
doi = {10.1109/taai.2016.7880154},
|
||||
booktitle = {2016 {Conference} on {Technologies} and {Applications} of {Artificial} {Intelligence} ({TAAI})},
|
||||
publisher = {IEEE},
|
||||
author = {Matsuzaki, Kiminori},
|
||||
month = nov,
|
||||
year = {2016},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/LYN4IZ38/Matsuzaki - 2016 - Systematic selection of N-tuple networks with cons.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{rodgers_investigation_2014,
|
||||
title = {An investigation into 2048 {AI} strategies},
|
||||
url = {https://doi.org/10.1109%2Fcig.2014.6932920},
|
||||
doi = {10.1109/cig.2014.6932920},
|
||||
booktitle = {2014 {IEEE} {Conference} on {Computational} {Intelligence} and {Games}},
|
||||
publisher = {IEEE},
|
||||
author = {Rodgers, Philip and Levine, John},
|
||||
month = aug,
|
||||
year = {2014},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/GWVBHIAP/Rodgers and Levine - 2014 - An investigation into 2048 AI strategies.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{anthony_learning_2020,
|
||||
title = {Learning to {Play} {No}-{Press} {Diplomacy} with {Best} {Response} {Policy} {Iteration}},
|
||||
url = {http://arxiv.org/abs/2006.04635v2},
|
||||
journal = {arxiv:2006.04635},
|
||||
author = {Anthony, Thomas and Eccles, Tom and Tacchetti, Andrea and Kramár, János and Gemp, Ian and Hudson, Thomas C. and Porcel, Nicolas and Lanctot, Marc and Pérolat, Julien and Everett, Richard and Singh, Satinder and Graepel, Thore and Bachrach, Yoram},
|
||||
year = {2020},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/RKH36CBQ/Anthony et al. - 2020 - Learning to Play No-Press Diplomacy with Best Resp.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{paquette_no_2019,
|
||||
title = {No {Press} {Diplomacy}: {Modeling} {Multi}-{Agent} {Gameplay}},
|
||||
url = {http://arxiv.org/abs/1909.02128v2},
|
||||
journal = {arxiv:1909.02128},
|
||||
author = {Paquette, Philip and Lu, Yuchen and Bocco, Steven and Smith, Max O. and Ortiz-Gagne, Satya and Kummerfeld, Jonathan K. and Singh, Satinder and Pineau, Joelle and Courville, Aaron},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/YHUCJAG8/Paquette et al. - 2019 - No Press Diplomacy Modeling Multi-Agent Gameplay.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{tan_agent_2019,
|
||||
title = {Agent {Madoff}: {A} {Heuristic}-{Based} {Negotiation} {Agent} {For} {The} {Diplomacy} {Strategy} {Game}},
|
||||
url = {http://arxiv.org/abs/1902.06996v1},
|
||||
journal = {arxiv:1902.06996},
|
||||
author = {Tan, Hao Hao},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/6Z6CSYSZ/Tan - 2019 - Agent Madoff A Heuristic-Based Negotiation Agent .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{gedda_monte_2018-1,
|
||||
title = {Monte {Carlo} {Methods} for the {Game} {Kingdomino}},
|
||||
url = {http://arxiv.org/abs/1807.04458v2},
|
||||
journal = {arxiv:1807.04458},
|
||||
author = {Gedda, Magnus and Lagerkvist, Mikael Z. and Butler, Martin},
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/T2BSPBPV/Gedda et al. - 2018 - Monte Carlo Methods for the Game Kingdomino.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{nguyen_np-completeness_2019,
|
||||
title = {{NP}-completeness of the game {Kingdomino}},
|
||||
url = {http://arxiv.org/abs/1909.02849v3},
|
||||
journal = {arxiv:1909.02849},
|
||||
author = {Nguyen, Viet-Ha and Perrot, Kevin and Vallet, Mathieu},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/32L6ZKCA/Nguyen et al. - 2019 - NP-completeness of the game Kingdomino.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{lerer_improving_2019,
|
||||
title = {Improving {Policies} via {Search} in {Cooperative} {Partially} {Observable} {Games}},
|
||||
url = {http://arxiv.org/abs/1912.02318v1},
|
||||
journal = {arxiv:1912.02318},
|
||||
author = {Lerer, Adam and Hu, Hengyuan and Foerster, Jakob and Brown, Noam},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/F2N99DK9/Lerer et al. - 2019 - Improving Policies via Search in Cooperative Parti.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{baffier_hanabi_2016,
|
||||
title = {Hanabi is {NP}-hard, {Even} for {Cheaters} who {Look} at {Their} {Cards}},
|
||||
url = {http://arxiv.org/abs/1603.01911v3},
|
||||
journal = {arxiv:1603.01911},
|
||||
author = {Baffier, Jean-Francois and Chiu, Man-Kwun and Diez, Yago and Korman, Matias and Mitsou, Valia and Renssen, André van and Roeloffzen, Marcel and Uno, Yushi},
|
||||
year = {2016},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/XMPLK7RJ/Baffier et al. - 2016 - Hanabi is NP-hard, Even for Cheaters who Look at T.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{canaan_generating_2020,
|
||||
title = {Generating and {Adapting} to {Diverse} {Ad}-{Hoc} {Cooperation} {Agents} in {Hanabi}},
|
||||
url = {http://arxiv.org/abs/2004.13710v2},
|
||||
journal = {arxiv:2004.13710},
|
||||
author = {Canaan, Rodrigo and Gao, Xianbo and Togelius, Julian and Nealen, Andy and Menzel, Stefan},
|
||||
year = {2020},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/PDZQXHYY/Canaan et al. - 2020 - Generating and Adapting to Diverse Ad-Hoc Cooperat.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{canaan_evaluating_2020,
|
||||
title = {Evaluating the {Rainbow} {DQN} {Agent} in {Hanabi} with {Unseen} {Partners}},
|
||||
url = {http://arxiv.org/abs/2004.13291v1},
|
||||
journal = {arxiv:2004.13291},
|
||||
author = {Canaan, Rodrigo and Gao, Xianbo and Chung, Youjin and Togelius, Julian and Nealen, Andy and Menzel, Stefan},
|
||||
year = {2020},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/DEVP82UJ/Canaan et al. - 2020 - Evaluating the Rainbow DQN Agent in Hanabi with Un.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{biderman_magic_2020,
|
||||
title = {Magic: the {Gathering} is as {Hard} as {Arithmetic}},
|
||||
url = {http://arxiv.org/abs/2003.05119v1},
|
||||
journal = {arxiv:2003.05119},
|
||||
author = {Biderman, Stella},
|
||||
year = {2020},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/N83MTIN9/Biderman - 2020 - Magic the Gathering is as Hard as Arithmetic.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{churchill_magic_2019,
|
||||
title = {Magic: {The} {Gathering} is {Turing} {Complete}},
|
||||
url = {http://arxiv.org/abs/1904.09828v2},
|
||||
journal = {arxiv:1904.09828},
|
||||
author = {Churchill, Alex and Biderman, Stella and Herrick, Austin},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/5NW5WTWK/Churchill et al. - 2019 - Magic The Gathering is Turing Complete.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{zilio_neural_2018,
|
||||
title = {Neural {Networks} {Models} for {Analyzing} {Magic}: the {Gathering} {Cards}},
|
||||
url = {http://arxiv.org/abs/1810.03744v1},
|
||||
journal = {arxiv:1810.03744},
|
||||
author = {Zilio, Felipe and Prates, Marcelo},
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/VX32HLNF/Zilio et al. - 2018 - Neural Networks Models for Analyzing Magic the Ga.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@inproceedings{grichshenko_using_2020,
|
||||
title = {Using {Tabu} {Search} {Algorithm} for {Map} {Generation} in the {Terra} {Mystica} {Tabletop} {Game}},
|
||||
url = {https://doi.org/10.1145%2F3396474.3396492},
|
||||
doi = {10.1145/3396474.3396492},
|
||||
booktitle = {Proceedings of the 2020 4th {International} {Conference} on {Intelligent} {Systems}, {Metaheuristics} \& {Swarm} {Intelligence}},
|
||||
publisher = {ACM},
|
||||
author = {Grichshenko, Alexandr and Araújo, Luiz Jonatã Pires de and Gimaeva, Susanna and Brown, Joseph Alexander},
|
||||
month = mar,
|
||||
year = {2020},
|
||||
file = {Submitted Version:/home/nemo/Zotero/storage/4LSZ3R5D/Grichshenko et al. - 2020 - Using Tabu Search Algorithm for Map Generation in .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{migdal_mathematical_2010,
|
||||
title = {A mathematical model of the {Mafia} game},
|
||||
url = {http://arxiv.org/abs/1009.1031v3},
|
||||
journal = {arxiv:1009.1031},
|
||||
author = {Migdał, Piotr},
|
||||
year = {2010},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/RCJ7EPW7/Migdał - 2010 - A mathematical model of the Mafia game.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{bai_automatic_2019,
|
||||
title = {Automatic {Long}-{Term} {Deception} {Detection} in {Group} {Interaction} {Videos}},
|
||||
url = {http://arxiv.org/abs/1905.08617v2},
|
||||
journal = {arxiv:1905.08617},
|
||||
author = {Bai, Chongyang and Bolonkin, Maksim and Burgoon, Judee and Chen, Chao and Dunbar, Norah and Singh, Bharat and Subrahmanian, V. S. and Wu, Zhe},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/WTS52YYD/Bai et al. - 2019 - Automatic Long-Term Deception Detection in Group I.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{serrino_finding_2019,
|
||||
title = {Finding {Friend} and {Foe} in {Multi}-{Agent} {Games}},
|
||||
url = {http://arxiv.org/abs/1906.02330v1},
|
||||
journal = {arxiv:1906.02330},
|
||||
author = {Serrino, Jack and Kleiman-Weiner, Max and Parkes, David C. and Tenenbaum, Joshua B.},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/L9PEVN2G/Serrino et al. - 2019 - Finding Friend and Foe in Multi-Agent Games.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{demaine_complexity_2010,
|
||||
title = {The complexity of {UNO}},
|
||||
url = {http://arxiv.org/abs/1003.2851v3},
|
||||
journal = {arxiv:1003.2851},
|
||||
author = {Demaine, Erik D. and Demaine, Martin L. and Harvey, Nicholas J. A. and Uehara, Ryuhei and Uno, Takeaki and Uno, Yushi},
|
||||
year = {2010},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/KNHHMQC3/Demaine et al. - 2010 - The complexity of UNO.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{bendekgey_clustering_2018,
|
||||
title = {Clustering {Player} {Strategies} from {Variable}-{Length} {Game} {Logs} in {Dominion}},
|
||||
url = {http://arxiv.org/abs/1811.11273v2},
|
||||
journal = {arxiv:1811.11273},
|
||||
author = {Bendekgey, Henry},
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/LUSHCYLJ/Bendekgey - 2018 - Clustering Player Strategies from Variable-Length .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{almanza_trainyard_2016,
|
||||
title = {Trainyard is {NP}-{Hard}},
|
||||
url = {http://arxiv.org/abs/1603.00928v1},
|
||||
journal = {arxiv:1603.00928},
|
||||
author = {Almanza, Matteo and Leucci, Stefano and Panconesi, Alessandro},
|
||||
year = {2016},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/6XZDBHIF/Almanza et al. - 2016 - Trainyard is NP-Hard.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{langerman_threes_2015,
|
||||
title = {Threes!, {Fives}, 1024!, and 2048 are {Hard}},
|
||||
url = {http://arxiv.org/abs/1505.04274v1},
|
||||
journal = {arxiv:1505.04274},
|
||||
author = {Langerman, Stefan and Uno, Yushi},
|
||||
year = {2015},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/EKHK8LWW/Langerman and Uno - 2015 - Threes!, Fives, 1024!, and 2048 are Hard.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{eppstein_making_2018,
|
||||
title = {Making {Change} in 2048},
|
||||
url = {http://arxiv.org/abs/1804.07396v1},
|
||||
journal = {arxiv:1804.07396},
|
||||
author = {Eppstein, David},
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/MTEUWS7P/Eppstein - 2018 - Making Change in 2048.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{das_analysis_2018,
|
||||
title = {Analysis of the {Game} "2048" and its {Generalization} in {Higher} {Dimensions}},
|
||||
url = {http://arxiv.org/abs/1804.07393v2},
|
||||
journal = {arxiv:1804.07393},
|
||||
author = {Das, Madhuparna and Paul, Goutam},
|
||||
year = {2018},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/IVPCDJKF/Das and Paul - 2018 - Analysis of the Game 2048 and its Generalization.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{yeh_multi-stage_2016,
|
||||
title = {Multi-{Stage} {Temporal} {Difference} {Learning} for 2048-like {Games}},
|
||||
url = {http://arxiv.org/abs/1606.07374v2},
|
||||
journal = {arxiv:1606.07374},
|
||||
author = {Yeh, Kun-Hao and Wu, I.-Chen and Hsueh, Chu-Hsuan and Chang, Chia-Chuan and Liang, Chao-Chin and Chiang, Han},
|
||||
year = {2016},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/XYA7M7R4/Yeh et al. - 2016 - Multi-Stage Temporal Difference Learning for 2048-.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{abdelkader_complexity_2015,
|
||||
title = {On the {Complexity} of {Slide}-and-{Merge} {Games}},
|
||||
url = {http://arxiv.org/abs/1501.03837v1},
|
||||
journal = {arxiv:1501.03837},
|
||||
author = {Abdelkader, Ahmed and Acharya, Aditya and Dasler, Philip},
|
||||
year = {2015},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/IZVA6FJ9/Abdelkader et al. - 2015 - On the Complexity of Slide-and-Merge Games.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{mehta_2048_2014,
|
||||
title = {2048 is ({PSPACE}) {Hard}, but {Sometimes} {Easy}},
|
||||
url = {http://arxiv.org/abs/1408.6315v1},
|
||||
journal = {arxiv:1408.6315},
|
||||
author = {Mehta, Rahul},
|
||||
year = {2014},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/TDMX7RFI/Mehta - 2014 - 2048 is (PSPACE) Hard, but Sometimes Easy.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{zha_rlcard_2019,
|
||||
title = {{RLCard}: {A} {Toolkit} for {Reinforcement} {Learning} in {Card} {Games}},
|
||||
url = {http://arxiv.org/abs/1910.04376v2},
|
||||
journal = {arxiv:1910.04376},
|
||||
author = {Zha, Daochen and Lai, Kwei-Herng and Cao, Yuanpu and Huang, Songyi and Wei, Ruzhe and Guo, Junyu and Hu, Xia},
|
||||
year = {2019},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/R8FEKMSG/Zha et al. - 2019 - RLCard A Toolkit for Reinforcement Learning in Ca.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@book{games_exploring_nodate,
|
||||
title = {Exploring {Anonymity} in {Cooperative}},
|
||||
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.225.5554&rep=rep1&type=pdf},
|
||||
author = {Games, Board and Linderoth, Jonas},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/GIVQ9ZHZ/Games and Linderoth - Exploring Anonymity in Cooperative.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@misc{noauthor_settlers_nodate,
|
||||
title = {Settlers of {Catan} bot trained using reinforcement learning},
|
||||
url = {https://jonzia.github.io/Catan/}
|
||||
}
|
||||
|
||||
@inproceedings{guhe_trading_2012,
|
||||
title = {Trading in a multiplayer board game: {Towards} an analysis of non-cooperative dialogue},
|
||||
volume = {34},
|
||||
booktitle = {Proceedings of the {Annual} {Meeting} of the {Cognitive} {Science} {Society}},
|
||||
author = {Guhe, Markus and Lascarides, Alex},
|
||||
year = {2012},
|
||||
note = {Issue: 34},
|
||||
file = {Guhe and Lascarides - 2012 - Trading in a multiplayer board game Towards an an.pdf:/home/nemo/Zotero/storage/AT8UHTXM/Guhe and Lascarides - 2012 - Trading in a multiplayer board game Towards an an.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{noauthor_pomcp_nodate,
|
||||
title = {{POMCP} with {Human} {Preferencesin} {Settlers} of {Catan}},
|
||||
url = {https://www.aaai.org/ocs/index.php/AIIDE/AIIDE18/paper/viewFile/18091/17217},
|
||||
file = {POMCP with Human Preferencesin Settlers of Catan.pdf:/home/nemo/Zotero/storage/CA62SLVK/POMCP with Human Preferencesin Settlers of Catan.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@misc{noauthor_impact_nodate,
|
||||
title = {The impact of loaded dice in {Catan}},
|
||||
url = {https://izbicki.me/blog/how-to-cheat-at-settlers-of-catan-by-loading-the-dice-and-prove-it-with-p-values.html}
|
||||
}
|
||||
|
||||
@article{noauthor_monte_nodate,
|
||||
title = {Monte {Carlo} {Tree} {Search} in a {Modern} {Board} {Game} {Framework}},
|
||||
url = {https://project.dke.maastrichtuniversity.nl/games/files/bsc/Roelofs_Bsc-paper.pdf},
|
||||
file = {Full Text:/home/nemo/Zotero/storage/QJUD6RDZ/Monte Carlo Tree Search in a Modern Board Game Fra.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@book{pfeiffer_reinforcement_2004,
|
||||
title = {Reinforcement {Learning} of {Strategies} for {Settlers} of {Catan}},
|
||||
author = {Pfeiffer, Michael},
|
||||
year = {2004},
|
||||
file = {Pfeiffer - 2004 - Reinforcement Learning of Strategies for Settlers .pdf:/home/nemo/Zotero/storage/9KJ7QYK4/Pfeiffer - 2004 - Reinforcement Learning of Strategies for Settlers .pdf:application/pdf}
|
||||
}
|
||||
|
||||
@misc{noauthor_intelligent_nodate,
|
||||
title = {An {Intelligent} {Artificial} {Player} for the {Game} of {Risk}},
|
||||
url = {http://www.ke.tu-darmstadt.de/lehre/archiv/ss04/oberseminar/folien/Wolf_Michael-Slides.pdf},
|
||||
file = {An Intelligent Artificial Player for the Game of R.pdf:/home/nemo/Zotero/storage/89MUCUE7/An Intelligent Artificial Player for the Game of R.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{noauthor_risky_nodate,
|
||||
title = {{RISKy} {Business}: {An} {In}-{Depth} {Look} at the {Game} {RISK}},
|
||||
url = {https://scholar.rose-hulman.edu/rhumj/vol3/iss2/3},
|
||||
file = {RISKy Business An In-Depth Look at the Game RISK.pdf:/home/nemo/Zotero/storage/PT8CWUJ5/RISKy Business An In-Depth Look at the Game RISK.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@article{noauthor_risk_nodate,
|
||||
title = {{RISK} {Board} {Game} ‐ {Battle} {Outcome} {Analysis}},
|
||||
url = {http://www.c4i.gr/xgeorgio/docs/RISK-board-game%20_rev-3.pdf},
|
||||
file = {RISK Board Game ‐ Battle Outcome Analysis.pdf:/home/nemo/Zotero/storage/IJR85DGR/RISK Board Game ‐ Battle Outcome Analysis.pdf:application/pdf;Full Text:/home/nemo/Zotero/storage/WPYDQ5CF/RISK Board Game ‐ Battle Outcome Analysis.pdf:application/pdf}
|
||||
}
|
||||
|
||||
@book{olsson_multi-agent_2005,
|
||||
title = {A multi-agent system for playing the board game risk},
|
||||
author = {Olsson, Fredrik},
|
||||
year = {2005}
|
||||
}
|
||||
Loading…
Reference in New Issue