conferencePaper
ISBN 978-1-4799-3547-5
2014 IEEE Conference on Computational Intelligence and Games
DOI 10.1109/CIG.2014.6932861
Dortmund, Germany
IEEE
Guhe
Markus
Lascarides
Alex
The effectiveness of persuasion in The Settlers of Catan
8/2014
DOI.org (Crossref)
http://ieeexplore.ieee.org/document/6932861/
2020-07-20 18:00:29
1-8
2014 IEEE Conference on Computational Intelligence and Games (CIG)
attachment
Submitted Version
https://www.pure.ed.ac.uk/ws/files/19353900/CIG2014.pdf
2020-07-20 18:01:02
1
application/pdf
attachment
Submitted Version
https://www.pure.ed.ac.uk/ws/files/19353900/CIG2014.pdf
2020-07-20 18:01:16
1
application/pdf
conferencePaper
2014 IEEE Conference on Computational Intelligence and Games
DOI 10.1109/cig.2014.6932861
IEEE
Guhe
Markus
Lascarides
Alex
The effectiveness of persuasion in The Settlers of Catan
August 2014
https://doi.org/10.1109%2Fcig.2014.6932861
attachment
Submitted Version
https://www.pure.ed.ac.uk/ws/files/19353900/CIG2014.pdf
2020-07-20 18:34:57
1
application/pdf
journalArticle
10
International Journal of Gaming and Computer-Mediated Simulations
DOI 10.4018/ijgcms.2018040103
2
Boda
Márton Attila
Avoiding Revenge Using Optimal Opponent Ranking Strategy in the Board Game Catan
April 2018
https://doi.org/10.4018%2Fijgcms.2018040103
Publisher: IGI Global
47–70
attachment
Full Text
https://sci-hub.se/downloads/2020-05-28/3d/boda2018.pdf#view=FitH
2020-07-20 18:22:11
1
application/pdf
conferencePaper
2014 IEEE Conference on Computational Intelligence and Games
DOI 10.1109/cig.2014.6932884
IEEE
Guhe
Markus
Lascarides
Alex
Game strategies for The Settlers of Catan
August 2014
https://doi.org/10.1109%2Fcig.2014.6932884
attachment
Submitted Version
https://www.pure.ed.ac.uk/ws/files/19351482/CIG2014_GS.pdf
2020-07-20 18:24:09
1
application/pdf
bookSection
Lecture Notes in Computer Science
Springer Berlin Heidelberg
Szita
István
Chaslot
Guillaume
Spronck
Pieter
Monte-Carlo Tree Search in Settlers of Catan
2010
https://doi.org/10.1007%2F978-3-642-12993-3_3
DOI: 10.1007/978-3-642-12993-3_3
21–32
attachment
Full Text
https://zero.sci-hub.se/5140/3f6b582d932254ee1b7d29e6e9683934/szita2010.pdf#view=FitH
2020-07-20 18:29:58
1
application/pdf
bookSection
Multi-Agent Systems
Springer International Publishing
Xenou
Konstantia
Chalkiadakis
Georgios
Afantenos
Stergos
Deep Reinforcement Learning in Strategic Board Game Environments
2019
https://doi.org/10.1007%2F978-3-030-14174-5_16
DOI: 10.1007/978-3-030-14174-5_16
233–248
attachment
Accepted Version
https://oatao.univ-toulouse.fr/22647/1/xenou_22647.pdf
2020-07-20 18:10:35
1
application/pdf
journalArticle
41
Journal of the Operational Research Society
DOI 10.1057/jors.1990.2
1
Maliphant
Sarah A.
Smith
David K.
Mini-Risk: Strategies for a Simplified Board Game
January 1990
https://doi.org/10.1057%2Fjors.1990.2
Publisher: Informa UK Limited
9–16
attachment
Full Text
https://zero.sci-hub.se/4681/0e142dbe029d345411eb5019cea0b10a/maliphant1990.pdf#view=FitH
2020-07-20 18:28:37
1
application/pdf
conferencePaper
Proceedings of the 2002 ACM symposium on Applied computing - SAC \textquotesingle02
DOI 10.1145/508791.508904
ACM Press
Neves
Atila
Brasāo
Osvaldo
Rosa
Agostinho
Learning the risk board game with classifier systems
2002
https://doi.org/10.1145%2F508791.508904
attachment
Full Text
https://dacemirror.sci-hub.se/proceedings-article/f9ce3c906d4e89b8aa3b90f15f0dfe20/neves2002.pdf#view=FitH
2020-07-20 18:26:40
1
application/pdf
journalArticle
70
Mathematics Magazine
DOI 10.1080/0025570x.1997.11996573
5
Tan
Bariş
Markov Chains and the RISK Board Game
December 1997
https://doi.org/10.1080%2F0025570x.1997.11996573
Publisher: Informa UK Limited
349–357
attachment
Full Text
https://twin.sci-hub.se/6853/3bdc3204e08f60618dca66f19b9cd1fc/markov-chains-and-the-risk-board-game-1997.pdf#view=FitH
2020-07-20 18:28:15
1
application/pdf
journalArticle
76
Mathematics Magazine
DOI 10.1080/0025570x.2003.11953165
2
Osborne
Jason A.
Markov Chains for the RISK Board Game Revisited
April 2003
https://doi.org/10.1080%2F0025570x.2003.11953165
Publisher: Informa UK Limited
129–135
attachment
Full Text
https://twin.sci-hub.se/6908/ad9e3c21b4a5edae31079e43ad12c8ce/osborne2003.pdf#view=FitH
2020-07-20 18:28:23
1
application/pdf
journalArticle
9
IEEE Trans. Evol. Computat.
DOI 10.1109/tevc.2005.856211
6
Vaccaro
J. M.
Guest
C. C.
Planning an Endgame Move Set for the Game RISK: A Comparison of Search Algorithms
December 2005
https://doi.org/10.1109%2Ftevc.2005.856211
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
641–652
attachment
Full Text
https://moscow.sci-hub.se/1819/0e61163e1173d174a5261879afc2c42d/vaccaro2005.pdf#view=FitH
2020-07-20 18:31:44
1
application/pdf
conferencePaper
2018 IEEE Conference on Computational Intelligence and Games (CIG)
DOI 10.1109/cig.2018.8490419
IEEE
Gedda
Magnus
Lagerkvist
Mikael Z.
Butler
Martin
Monte Carlo Methods for the Game Kingdomino
August 2018
https://doi.org/10.1109%2Fcig.2018.8490419
attachment
Submitted Version
https://arxiv.org/pdf/1807.04458
2020-07-20 18:29:37
1
application/pdf
journalArticle
88
Mathematics Magazine
DOI 10.4169/math.mag.88.5.323
5
Cox
Christopher
Silva
Jessica De
Deorsey
Philip
Kenter
Franklin H. J.
Retter
Troy
Tobin
Josh
How to Make the Perfect Fireworks Display: Two Strategies forHanabi
December 2015
https://doi.org/10.4169%2Fmath.mag.88.5.323
Publisher: Informa UK Limited
323–336
attachment
Full Text
https://moscow.sci-hub.se/5019/aae1c968ecb4576818556c669a20e535/christophercox2015.pdf#view=FitH
2020-07-20 18:26:02
1
application/pdf
conferencePaper
2017 IEEE Congress on Evolutionary Computation (CEC)
DOI 10.1109/cec.2017.7969465
IEEE
Walton-Rivers
Joseph
Williams
Piers R.
Bartle
Richard
Perez-Liebana
Diego
Lucas
Simon M.
Evaluating and modelling Hanabi-playing agents
June 2017
https://doi.org/10.1109%2Fcec.2017.7969465
attachment
Accepted Version
https://repository.essex.ac.uk/20341/1/1704.07069v1.pdf
2020-07-20 18:16:01
1
application/pdf
journalArticle
280
Artificial Intelligence
DOI 10.1016/j.artint.2019.103216
Bard
Nolan
Foerster
Jakob N.
Chandar
Sarath
Burch
Neil
Lanctot
Marc
Song
H. Francis
Parisotto
Emilio
Dumoulin
Vincent
Moitra
Subhodeep
Hughes
Edward
Dunning
Iain
Mourad
Shibl
Larochelle
Hugo
Bellemare
Marc G.
Bowling
Michael
The Hanabi challenge: A new frontier for AI research
March 2020
https://doi.org/10.1016%2Fj.artint.2019.103216
Publisher: Elsevier BV
103216
attachment
Full Text
https://pdf.sciencedirectassets.com/271585/1-s2.0-S0004370219X00120/1-s2.0-S0004370219300116/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEHoaCXVzLWVhc3QtMSJGMEQCIH1Rh0U0FaCQrRRyUSiT86nBmiJQoMaX1VTfIk3CSCBuAiBVtUw9mFSXO4P2IR2s2Cqs5kI4CwPLTkYQLjfgja598Sq0AwgzEAMaDDA1OTAwMzU0Njg2NSIMyb025En2S0rT1ZZeKpEDm01bDtAwa5C41YjSxTlisMeVuPdMt%2Fpp3ln9ZE3BEsM0TrGG0EvzEx3c85DHMJoG3oK32WnIGWwPieFnqEZGQJ5kP%2BEtnPQMUzxY7WXMipZQ%2Fmkao3oL%2Fu%2BbKsSHJ%2BAolhMh0G%2F1YvpVoepC6rGy8rku6DXcS0XWgvUzcoLJlcPRRsF5pGQp6xFOR1RW2pR6oq9UoJWEImFDw6X2g2MgPaFMRXMo71FNVX7Zix2oWGhaDRS0hMEerYFvmj1Lv0rmQbAo2h0lvvTZkGWrcauFFEjILxJFadqwcK4Xfe%2BfFDR2H61VZ7B792qzjSC8vCsAToK8BSVepuCnVpDM04cKPnrsiqtR2WMuCMYlS2w%2BLRCk03EjXQvU8ZR8J63MmEPpbJ7pS6JnI%2B0nCcCYtvb7yqcWTzmHjPN6ssNUpPX1ajjjlZyaFm5ntqyCxL0tYar6ra3TkmF2Lbesk%2F1wLTuqnLhsIEmzB01wzw%2BEd%2BxW7PZnDHKM%2FeBPaeg1Z2VaL%2BuwDGWMhBnk8O2sUafc2qT%2BRzMwuLHX%2BAU67AH1wVDVhIqhENwF1N9Pv%2BLhicrQXiHJ79HC1JGf9ulqBM9sLRnFjdyxRYUm6O%2F9RPSV6OTVARQGNQpBBqJUN5%2BCfvHvl%2BVgfEa3fTERLxkX1QBTsTGKAzKee1BjQylRYNnTLhUm0CV56l3jCBMG9LwpodFZgoMHURoqbkWDV9HkAS9W6LnIvcy4L7e76c3qrpB%2B1XoEzqX%2BpQ3S4lRCVR5NcTLnUmxww4%2Br8nzca5CibEM9l033knReVVZnjt2JZVzZVW6zXpO60OH%2F6W2N1qYvsY3oOLT7kX5w7GNCi4qrNANQLGrPXDDqLOuI2A%3D%3D&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20200720T183502Z&X-Amz-SignedHeaders=host&X-Amz-Expires=300&X-Amz-Credential=ASIAQ3PHCVTY6ZAVFJHH%2F20200720%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=15beeda55689b6fd5e9d2d05b5ac322d5b98fdc5d4f70683cb530821a98eef3c&hash=9fe7e987a2d4bc206328d68796fc691838e0a0ff5373120293f9b5d82fefded1&host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&pii=S0004370219300116&tid=spdf-54a6ffb6-7f42-4d75-84e1-5f15f936d894&sid=76772d953af62548ae38ab517857dea18c60gxrqb&type=client
2020-07-20 18:35:12
1
application/pdf
conferencePaper
2019 IEEE Conference on Games (CoG)
DOI 10.1109/cig.2019.8848008
IEEE
Walton-Rivers
Joseph
Williams
Piers R.
Bartle
Richard
The 2018 Hanabi competition
August 2019
https://doi.org/10.1109%2Fcig.2019.8848008
attachment
Accepted Version
https://repository.essex.ac.uk/26898/2/hanabi.pdf
2020-07-20 18:34:35
1
application/pdf
conferencePaper
2019 IEEE Conference on Games (CoG)
DOI 10.1109/cig.2019.8847944
IEEE
Canaan
Rodrigo
Togelius
Julian
Nealen
Andy
Menzel
Stefan
Diverse Agents for Ad-Hoc Cooperation in Hanabi
August 2019
https://doi.org/10.1109%2Fcig.2019.8847944
attachment
Submitted Version
https://arxiv.org/pdf/1907.03840
2020-07-20 18:11:10
1
application/pdf
journalArticle
45
Mathematics Magazine
DOI 10.1080/0025570x.1972.11976187
1
Ash
Robert B.
Bishop
Richard L.
Monopoly as a Markov Process
January 1972
https://doi.org/10.1080%2F0025570x.1972.11976187
Publisher: Informa UK Limited
26–29
attachment
Submitted Version
https://www.math.uiuc.edu/%7Ebishop/monopoly.pdf
2020-07-20 18:37:15
1
application/pdf
journalArticle
4
IEEE Trans. Comput. Intell. AI Games
DOI 10.1109/tciaig.2012.2204883
4
Cowling
Peter I.
Ward
Colin D.
Powley
Edward J.
Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering
December 2012
https://doi.org/10.1109%2Ftciaig.2012.2204883
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
241–257
attachment
Accepted Version
https://eprints.whiterose.ac.uk/75050/1/EnsDetMagic.pdf
2020-07-20 18:14:45
1
application/pdf
journalArticle
31
The College Mathematics Journal
DOI 10.1080/07468342.2000.11974103
1
Bosch
Robert A.
Optimal Card-Collecting Strategies for Magic: The Gathering
January 2000
https://doi.org/10.1080%2F07468342.2000.11974103
Publisher: Informa UK Limited
15–21
attachment
Full Text
https://zero.sci-hub.se/6795/ba844bedd2d417e4393d7af19bb3dd47/bosch2000.pdf#view=FitH
2020-07-20 18:37:22
1
application/pdf
conferencePaper
2009 IEEE Symposium on Computational Intelligence and Games
DOI 10.1109/cig.2009.5286501
IEEE
Ward
C. D.
Cowling
P. I.
Monte Carlo search applied to card selection in Magic: The Gathering
September 2009
https://doi.org/10.1109%2Fcig.2009.5286501
attachment
Full Text
https://dacemirror.sci-hub.se/proceedings-article/dfcfc3f5502682650ac71b68af8f9b19/ward2009.pdf#view=FitH
2020-07-20 18:29:50
1
application/pdf
bookSection
Lecture Notes in Computer Science
Springer Berlin Heidelberg
Demaine
Erik D.
Demaine
Martin L.
Uehara
Ryuhei
Uno
Takeaki
Uno
Yushi
UNO Is Hard, Even for a Single Player
2010
https://doi.org/10.1007%2F978-3-642-13122-6_15
DOI: 10.1007/978-3-642-13122-6_15
133–144
attachment
Submitted Version
https://dspace.mit.edu/bitstream/1721.1/62147/1/Demaine_UNO%20is.pdf
2020-07-20 18:36:18
1
application/pdf
journalArticle
Information Processing Letters
DOI 10.1016/j.ipl.2020.105995
Mishiba
Shohei
Takenaga
Yasuhiko
QUIXO is EXPTIME-complete
July 2020
https://doi.org/10.1016%2Fj.ipl.2020.105995
Publisher: Elsevier BV
105995
attachment
Full Text
https://pdf.sciencedirectassets.com/271527/AIP/1-s2.0-S002001902030082X/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEHoaCXVzLWVhc3QtMSJGMEQCIFtkSBpgjQCGD2t9HhDGKXByeuMLxjq5SpZiHiVJRtD2AiBGNfyOHc5rhR9YOWBJqfm4Q4sk9A7DiAYQK4bE21l10yq0AwgyEAMaDDA1OTAwMzU0Njg2NSIMTbV17TBAQ%2BDOw4NqKpEDFYUi3wRhC%2Baj5%2FaTwaaOsbSSQ1WVXW9J%2FkDFGuUgFScfYqdG0aRaazztSFianGDgj1FEpVC%2FwLMP8LEWFghexDo2fLhZpoaNA5v8DQIvrvb839ZJGlCB9HEcbyeStsLWWrl8pM1lYBckbsmir72eSqxkPqyFfdxni2pG4HcCVuJHe6pPJwoGPGoTndv1mCghHzuk9rvPiegQ9iaKu947uL9xnhB1c7TzMUf2EGPeKuB2jm4F5duW8V3IzqQjPf3tMPSRNn8Ztv1qlO8vUhpXTsyI5dH%2BURZTqOVp0fVn4En6CRNrkv05g%2B1rxq6b6gQmlfUeAIPaTwUfI2glYGtZKNkvlkYrZKoWvHkv9XzLd3%2FKiuaeKxM9nk4hZjJqtcWwaD3Gp9yr63IUPqUZW5BI2YJHNW%2B9SIbRzBmubE0b01LVFubW9rJo3hPtgKRHPpIEIm0j%2FjoszFdpyL4chFaML0HxrCmQeh7HkvJBMvERUM%2F882V%2FBm2zHRuKsPNpLUj%2BJ%2BDh6%2FQaE0pmoIOfTbNN8xIwnaLX%2BAU67AFOxpNyX5biC5h3HLfyBGY1KrsDmnyo3bcOIqAwepos4Dw%2BlQ8II9AjVQwzEJGvd8LQ9sYaZzntH7rnuZG15wBizwUDkD2G37c91hT%2BG9hKPKHkW9jZp6XijVMHYWhd34TF6iW%2BQSM5bMzKdQaXzoilRts%2B5DaLCeYk%2Fzc2FFcSMOT3pXBXWHr%2F16lr5Sp8Gh9FS9HnwI2O8pxy6E1lqGM0wP%2FwaWBT3HgdR2tvjQzn%2BcjDDKHABtqj3oo6janO3IKOPaFzYHFqiL0DS8Pet5gUVYynm9m37o5M3%2B6y7YoaXnoq1o1goiX6Zv0S5A%3D%3D&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20200720T183148Z&X-Amz-SignedHeaders=host&X-Amz-Expires=300&X-Amz-Credential=ASIAQ3PHCVTYWL2N32C3%2F20200720%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=99c8222a858071c0b65fa6dac4ea0e1b548c1a4eb23ccac06cf864c7013a7593&hash=d2c7df4c2396ff204caa66ac0553e18f1b2712399c07b6e674199859ccc1b7f9&host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&pii=S002001902030082X&tid=spdf-742da070-9da3-43f1-861e-f733776129ef&sid=76772d953af62548ae38ab517857dea18c60gxrqb&type=client
2020-07-20 18:31:53
1
application/pdf
bookSection
Case-Based Reasoning Research and Development
Springer International Publishing
Woolford
Michael
Watson
Ian
SCOUT: A Case-Based Reasoning Agent for Playing Race for the Galaxy
2017
https://doi.org/10.1007%2F978-3-319-61030-6_27
DOI: 10.1007/978-3-319-61030-6_27
390–402
attachment
Woolford and Watson - 2017 - SCOUT A Case-Based Reasoning Agent for Playing Ra.pdf
application/pdf
journalArticle
85
Mathematics Magazine
DOI 10.4169/math.mag.85.2.083
2
Coleman
Ben
Hartshorn
Kevin
Game, Set, Math
April 2012
https://doi.org/10.4169%2Fmath.mag.85.2.083
Publisher: Informa UK Limited
83–96
attachment
Full Text
https://dacemirror.sci-hub.se/journal-article/768dabc67f6adcaa34a4c087b56b4283/game-set-math-2012.pdf#view=FitH
2020-07-20 18:24:32
1
application/pdf
journalArticle
125
The American Mathematical Monthly
DOI 10.1080/00029890.2018.1412661
3
Glass
Darren
The Joy of SET
February 2018
https://doi.org/10.1080%2F00029890.2018.1412661
Publisher: Informa UK Limited
284–288
attachment
Full Text
https://twin.sci-hub.se/6684/b949dbda2e3438aae344825abb7d0ff3/glass2018.pdf#view=FitH
2020-07-20 18:35:34
1
application/pdf
bookSection
Communications in Computer and Information Science
Springer Berlin Heidelberg
Lazarusli
Irene A.
Lukas
Samuel
Widjaja
Patrick
Implementation of Artificial Intelligence with 3 Different Characters of AI Player on “Monopoly Deal” Computer Game
2015
https://doi.org/10.1007%2F978-3-662-46742-8_11
DOI: 10.1007/978-3-662-46742-8_11
119–127
bookSection
Computers and Games
Springer Berlin Heidelberg
Pawlewicz
Jakub
Nearly Optimal Computer Play in Multi-player Yahtzee
2011
https://doi.org/10.1007%2F978-3-642-17928-0_23
DOI: 10.1007/978-3-642-17928-0_23
250–262
conferencePaper
2007 IEEE Symposium on Computational Intelligence and Games
DOI 10.1109/cig.2007.368089
IEEE
Glenn
James R.
Computer Strategies for Solitaire Yahtzee
2007
https://doi.org/10.1109%2Fcig.2007.368089
attachment
Submitted Version
http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=707B7E09A9652A1E4F2AB4BF608C410A?doi=10.1.1.111.1724&rep=rep1&type=pdf
2020-07-20 18:09:04
1
application/pdf
journalArticle
18
Expert Systems
DOI 10.1111/1468-0394.00160
2
Maynard
Ken
Moss
Patrick
Whitehead
Marcus
Narayanan
S.
Garay
Matt
Brannon
Nathan
Kantamneni
Raj Gopal
Kustra
Todd
Modeling expert problem solving in a game of chance: a Yahtzeec case study
May 2001
https://doi.org/10.1111%2F1468-0394.00160
Publisher: Wiley
88–98
attachment
Full Text
https://cyber.sci-hub.se/MTAuMTExMS8xNDY4LTAzOTQuMDAxNjA=/maynard2001.pdf#view=FitH
2020-07-20 18:29:00
1
application/pdf
bookSection
Computers and Games
Springer International Publishing
Oka
Kazuto
Matsuzaki
Kiminori
Systematic Selection of N-Tuple Networks for 2048
2016
https://doi.org/10.1007%2F978-3-319-50935-8_8
DOI: 10.1007/978-3-319-50935-8_8
81–92
attachment
Full Text
https://sci-hub.se/downloads/2020-05-25/5f/oka2016.pdf#view=FitH
2020-07-20 18:32:30
1
application/pdf
conferencePaper
2016 Conference on Technologies and Applications of Artificial Intelligence (TAAI)
DOI 10.1109/taai.2016.7880154
IEEE
Matsuzaki
Kiminori
Systematic selection of N-tuple networks with consideration of interinfluence for game 2048
November 2016
https://doi.org/10.1109%2Ftaai.2016.7880154
attachment
Full Text
https://twin.sci-hub.se/6299/d9bbecbbec212dab7fe6e6a67213b1cb/matsuzaki2016.pdf#view=FitH
2020-07-20 18:32:39
1
application/pdf
conferencePaper
2014 IEEE Conference on Computational Intelligence and Games
DOI 10.1109/cig.2014.6932920
IEEE
Rodgers
Philip
Levine
John
An investigation into 2048 AI strategies
August 2014
https://doi.org/10.1109%2Fcig.2014.6932920
attachment
Full Text
https://zero.sci-hub.se/3377/2e196ce6e3cb06a636bf1ffdee8f5b6f/rodgers2014.pdf#view=FitH
2020-07-20 18:21:23
1
application/pdf
journalArticle
arxiv:2006.04635
Anthony
Thomas
Eccles
Tom
Tacchetti
Andrea
Kramár
János
Gemp
Ian
Hudson
Thomas C.
Porcel
Nicolas
Lanctot
Marc
Pérolat
Julien
Everett
Richard
Singh
Satinder
Graepel
Thore
Bachrach
Yoram
Learning to Play No-Press Diplomacy with Best Response Policy Iteration
2020
http://arxiv.org/abs/2006.04635v2
attachment
Full Text
https://arxiv.org/pdf/2006.04635v2.pdf
2020-07-20 18:27:18
1
application/pdf
journalArticle
arxiv:1909.02128
Paquette
Philip
Lu
Yuchen
Bocco
Steven
Smith
Max O.
Ortiz-Gagne
Satya
Kummerfeld
Jonathan K.
Singh
Satinder
Pineau
Joelle
Courville
Aaron
No Press Diplomacy: Modeling Multi-Agent Gameplay
2019
http://arxiv.org/abs/1909.02128v2
attachment
Full Text
https://arxiv.org/pdf/1909.02128v2.pdf
2020-07-20 18:31:04
1
application/pdf
journalArticle
arxiv:1902.06996
Tan
Hao Hao
Agent Madoff: A Heuristic-Based Negotiation Agent For The Diplomacy Strategy Game
2019
http://arxiv.org/abs/1902.06996v1
attachment
Full Text
https://arxiv.org/pdf/1902.06996v1.pdf
2020-07-20 18:21:06
1
application/pdf
journalArticle
arxiv:1807.04458
Gedda
Magnus
Lagerkvist
Mikael Z.
Butler
Martin
Monte Carlo Methods for the Game Kingdomino
2018
http://arxiv.org/abs/1807.04458v2
attachment
Full Text
https://arxiv.org/pdf/1807.04458v2.pdf
2020-07-20 18:29:18
1
application/pdf
journalArticle
arxiv:1909.02849
Nguyen
Viet-Ha
Perrot
Kevin
Vallet
Mathieu
NP-completeness of the game Kingdomino
2019
http://arxiv.org/abs/1909.02849v3
attachment
Full Text
https://arxiv.org/pdf/1909.02849v3.pdf
2020-07-20 18:31:12
1
application/pdf
journalArticle
arxiv:1912.02318
Lerer
Adam
Hu
Hengyuan
Foerster
Jakob
Brown
Noam
Improving Policies via Search in Cooperative Partially Observable Games
2019
http://arxiv.org/abs/1912.02318v1
attachment
Full Text
https://arxiv.org/pdf/1912.02318v1.pdf
2020-07-20 18:26:28
1
application/pdf
journalArticle
arxiv:1603.01911
Baffier
Jean-Francois
Chiu
Man-Kwun
Diez
Yago
Korman
Matias
Mitsou
Valia
Renssen
André van
Roeloffzen
Marcel
Uno
Yushi
Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
2016
http://arxiv.org/abs/1603.01911v3
attachment
Full Text
https://arxiv.org/pdf/1603.01911v3.pdf
2020-07-20 18:25:31
1
application/pdf
journalArticle
arxiv:2004.13710
Canaan
Rodrigo
Gao
Xianbo
Togelius
Julian
Nealen
Andy
Menzel
Stefan
Generating and Adapting to Diverse Ad-Hoc Cooperation Agents in Hanabi
2020
http://arxiv.org/abs/2004.13710v2
attachment
Full Text
https://arxiv.org/pdf/2004.13710v2.pdf
2020-07-20 18:25:19
1
application/pdf
journalArticle
arxiv:2004.13291
Canaan
Rodrigo
Gao
Xianbo
Chung
Youjin
Togelius
Julian
Nealen
Andy
Menzel
Stefan
Evaluating the Rainbow DQN Agent in Hanabi with Unseen Partners
2020
http://arxiv.org/abs/2004.13291v1
attachment
Full Text
https://arxiv.org/pdf/2004.13291v1.pdf
2020-07-20 18:22:45
1
application/pdf
journalArticle
arxiv:2003.05119
Biderman
Stella
Magic: the Gathering is as Hard as Arithmetic
2020
http://arxiv.org/abs/2003.05119v1
attachment
Full Text
https://arxiv.org/pdf/2003.05119v1.pdf
2020-07-20 18:27:42
1
application/pdf
journalArticle
arxiv:1904.09828
Churchill
Alex
Biderman
Stella
Herrick
Austin
Magic: The Gathering is Turing Complete
2019
http://arxiv.org/abs/1904.09828v2
attachment
Full Text
https://arxiv.org/pdf/1904.09828v2.pdf
2020-07-20 18:27:51
1
application/pdf
journalArticle
arxiv:1810.03744
Zilio
Felipe
Prates
Marcelo
Neural Networks Models for Analyzing Magic: the Gathering Cards
2018
http://arxiv.org/abs/1810.03744v1
attachment
Full Text
https://arxiv.org/pdf/1810.03744v1.pdf
2020-07-20 18:30:42
1
application/pdf
conferencePaper
Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
DOI 10.1145/3396474.3396492
ACM
Grichshenko
Alexandr
Araújo
Luiz Jonatã Pires de
Gimaeva
Susanna
Brown
Joseph Alexander
Using Tabu Search Algorithm for Map Generation in the Terra Mystica Tabletop Game
March 2020
https://doi.org/10.1145%2F3396474.3396492
attachment
Submitted Version
https://arxiv.org/pdf/2006.02716
2020-07-20 18:36:31
1
application/pdf
journalArticle
arxiv:1009.1031
Migdał
Piotr
A mathematical model of the Mafia game
2010
http://arxiv.org/abs/1009.1031v3
attachment
Full Text
https://arxiv.org/pdf/1009.1031v3.pdf
2020-07-20 18:20:44
1
application/pdf
journalArticle
arxiv:1003.2851
Demaine
Erik D.
Demaine
Martin L.
Harvey
Nicholas J. A.
Uehara
Ryuhei
Uno
Takeaki
Uno
Yushi
The complexity of UNO
2010
http://arxiv.org/abs/1003.2851v3
attachment
Full Text
https://arxiv.org/pdf/1003.2851v3.pdf
2020-07-20 18:34:43
1
application/pdf
journalArticle
arxiv:1603.00928
Almanza
Matteo
Leucci
Stefano
Panconesi
Alessandro
Trainyard is NP-Hard
2016
http://arxiv.org/abs/1603.00928v1
attachment
Full Text
https://arxiv.org/pdf/1603.00928v1.pdf
2020-07-20 18:36:08
1
application/pdf
journalArticle
arxiv:1505.04274
Langerman
Stefan
Uno
Yushi
Threes!, Fives, 1024!, and 2048 are Hard
2015
http://arxiv.org/abs/1505.04274v1
attachment
Full Text
https://arxiv.org/pdf/1505.04274v1.pdf
2020-07-20 18:35:46
1
application/pdf
journalArticle
arxiv:1804.07396
Eppstein
David
Making Change in 2048
2018
http://arxiv.org/abs/1804.07396v1
attachment
Full Text
https://arxiv.org/pdf/1804.07396v1.pdf
2020-07-20 18:28:01
1
application/pdf
journalArticle
arxiv:1804.07393
Das
Madhuparna
Paul
Goutam
Analysis of the Game "2048" and its Generalization in Higher Dimensions
2018
http://arxiv.org/abs/1804.07393v2
attachment
Full Text
https://arxiv.org/pdf/1804.07393v2.pdf
2020-07-20 18:21:31
1
application/pdf
journalArticle
arxiv:1606.07374
Yeh
Kun-Hao
Wu
I.-Chen
Hsueh
Chu-Hsuan
Chang
Chia-Chuan
Liang
Chao-Chin
Chiang
Han
Multi-Stage Temporal Difference Learning for 2048-like Games
2016
http://arxiv.org/abs/1606.07374v2
attachment
Full Text
https://arxiv.org/pdf/1606.07374v2.pdf
2020-07-20 18:30:19
1
application/pdf
journalArticle
arxiv:1408.6315
Mehta
Rahul
2048 is (PSPACE) Hard, but Sometimes Easy
2014
http://arxiv.org/abs/1408.6315v1
attachment
Full Text
https://arxiv.org/pdf/1408.6315v1.pdf
2020-07-20 18:20:36
1
application/pdf
computerProgram
Settlers of Catan bot trained using reinforcement learning
https://jonzia.github.io/Catan/
MATLAB
conferencePaper
34
Proceedings of the Annual Meeting of the Cognitive Science Society
Guhe
Markus
Lascarides
Alex
Trading in a multiplayer board game: Towards an analysis of non-cooperative dialogue
2012
Issue: 34
attachment
Guhe and Lascarides - 2012 - Trading in a multiplayer board game Towards an an.pdf
application/pdf
journalArticle
POMCP with Human Preferencesin Settlers of Catan
https://www.aaai.org/ocs/index.php/AIIDE/AIIDE18/paper/viewFile/18091/17217
attachment
POMCP with Human Preferencesin Settlers of Catan.pdf
application/pdf
blogPost
The impact of loaded dice in Catan
https://izbicki.me/blog/how-to-cheat-at-settlers-of-catan-by-loading-the-dice-and-prove-it-with-p-values.html
journalArticle
Monte Carlo Tree Search in a Modern Board Game Framework
https://project.dke.maastrichtuniversity.nl/games/files/bsc/Roelofs_Bsc-paper.pdf
attachment
Full Text
https://project.dke.maastrichtuniversity.nl/games/files/bsc/Roelofs_Bsc-paper.pdf
2020-07-20 18:47:19
1
application/pdf
book
Pfeiffer
Michael
Reinforcement Learning of Strategies for Settlers of Catan
2004
attachment
Pfeiffer - 2004 - Reinforcement Learning of Strategies for Settlers .pdf
application/pdf
presentation
An Intelligent Artificial Player for the Game of Risk
http://www.ke.tu-darmstadt.de/lehre/archiv/ss04/oberseminar/folien/Wolf_Michael-Slides.pdf
attachment
An Intelligent Artificial Player for the Game of R.pdf
application/pdf
journalArticle
RISKy Business: An In-Depth Look at the Game RISK
https://scholar.rose-hulman.edu/rhumj/vol3/iss2/3
attachment
RISKy Business An In-Depth Look at the Game RISK.pdf
application/pdf
journalArticle
RISK Board Game ‐ Battle Outcome Analysis
http://www.c4i.gr/xgeorgio/docs/RISK-board-game%20_rev-3.pdf
attachment
RISK Board Game ‐ Battle Outcome Analysis.pdf
application/pdf
attachment
Full Text
https://www.c4i.gr/xgeorgio/docs/RISK-board-game%20_rev-3.pdf
2020-07-20 18:54:23
1
application/pdf
book
Olsson
Fredrik
A multi-agent system for playing the board game risk
2005
blogPost
State Representation and Polyomino Placement for the Game Patchwork
https://zayenz.se/blog/post/patchwork-modref2019-paper/
journalArticle
arXiv:2001.04233 [cs]
Lagerkvist
Mikael Zayenz
Computer Science - Artificial Intelligence
State Representation and Polyomino Placement for the Game Patchwork
Modern board games are a rich source of entertainment for many people, but also contain interesting and challenging structures for game playing research and implementing game playing agents. This paper studies the game Patchwork, a two player strategy game using polyomino tile drafting and placement. The core polyomino placement mechanic is implemented in a constraint model using regular constraints, extending and improving the model in (Lagerkvist, Pesant, 2008) with: explicit rotation handling; optional placements; and new constraints for resource usage. Crucial for implementing good game playing agents is to have great heuristics for guiding the search when faced with large branching factors. This paper divides placing tiles into two parts: a policy used for placing parts and an evaluation used to select among different placements. Policies are designed based on classical packing literature as well as common standard constraint programming heuristics. For evaluation, global propagation guided regret is introduced, choosing placements based on not ruling out later placements. Extensive evaluations are performed, showing the importance of using a good evaluation and that the proposed global propagation guided regret is a very effective guide.
2020-01-13
arXiv.org
http://arxiv.org/abs/2001.04233
2020-07-21 10:55:58
arXiv: 2001.04233
<p>Code: <a href="https://github.com/zayenz/cp-mod-ref-2019-patchwork">https://github.com/zayenz/cp-mod-ref-2019-patchwork</a></p>
<p> </p>
<p>Comment: In ModRef 2019, The 18th workshop on Constraint Modelling and Reformulation</p>
attachment
arXiv Fulltext PDF
https://arxiv.org/pdf/2001.04233.pdf
2020-07-21 10:56:09
1
application/pdf
attachment
arXiv.org Snapshot
https://arxiv.org/abs/2001.04233
2020-07-21 10:56:13
1
text/html
presentation
State Representation and Polyomino Placement for the Game Patchwork
https://zayenz.se/papers/Lagerkvist_ModRef_2019_Presentation.pdf
attachment
Full Text
https://zayenz.se/papers/Lagerkvist_ModRef_2019_Presentation.pdf
2020-07-21 10:56:59
1
application/pdf
journalArticle
arXiv:2001.04238 [cs]
Lagerkvist
Mikael Zayenz
Computer Science - Artificial Intelligence
Nmbr9 as a Constraint Programming Challenge
Modern board games are a rich source of interesting and new challenges for combinatorial problems. The game Nmbr9 is a solitaire style puzzle game using polyominoes. The rules of the game are simple to explain, but modelling the game effectively using constraint programming is hard. This abstract presents the game, contributes new generalized variants of the game suitable for benchmarking and testing, and describes a model for the presented variants. The question of the top possible score in the standard game is an open challenge.
2020-01-13
arXiv.org
http://arxiv.org/abs/2001.04238
2020-07-21 10:57:58
arXiv: 2001.04238
<p>Code: https://github.com/zayenz/cp-2019-nmbr9/</p>
<p>Comment: Abstract at the 25th International Conference on Principles and Practice of Constraint Programming</p>
attachment
arXiv Fulltext PDF
https://arxiv.org/pdf/2001.04238.pdf
2020-07-21 10:58:01
1
application/pdf
attachment
arXiv.org Snapshot
https://arxiv.org/abs/2001.04238
2020-07-21 10:58:02
1
text/html
blogPost
Nmbr9 as a Constraint Programming Challenge
https://zayenz.se/blog/post/nmbr9-cp2019-abstract/
conferencePaper
DOI 10.1109/CIG.2019.8848097
Goodman
James
Re-determinizing MCTS in Hanabi
08 2019
1-8
attachment
Goodman - 2019 - Re-determinizing MCTS in Hanabi.pdf
application/pdf
conferencePaper
ISBN 978-1-5386-4359-4
2018 IEEE Conference on Computational Intelligence and Games (CIG)
DOI 10.1109/CIG.2018.8490449
Maastricht
IEEE
Canaan
Rodrigo
Shen
Haotian
Torrado
Ruben
Togelius
Julian
Nealen
Andy
Menzel
Stefan
Evolving Agents for the Hanabi 2018 CIG Competition
8/2018
DOI.org (Crossref)
https://ieeexplore.ieee.org/document/8490449/
2020-07-21 11:01:52
1-8
2018 IEEE Conference on Computational Intelligence and Games (CIG)
attachment
Submitted Version
https://arxiv.org/pdf/1809.09764
2020-07-21 11:01:56
1
application/pdf
bookSection
765
ISBN 978-3-319-67467-4 978-3-319-67468-1
BNAIC 2016: Artificial Intelligence
Cham
Springer International Publishing
Bosse
Tibor
Bredeweg
Bert
van den Bergh
Mark J. H.
Hommelberg
Anne
Kosters
Walter A.
Spieksma
Flora M.
Aspects of the Cooperative Card Game Hanabi
2017
DOI.org (Crossref)
http://link.springer.com/10.1007/978-3-319-67468-1_7
2020-07-21 11:02:26
Series Title: Communications in Computer and Information Science
DOI: 10.1007/978-3-319-67468-1_7
93-105
attachment
Full Text
https://twin.sci-hub.se/6548/49fca9bfed767f739defcd030c004bdb/vandenbergh2017.pdf#view=FitH
2020-07-21 11:02:31
1
application/pdf
bookSection
10664
ISBN 978-3-319-71648-0 978-3-319-71649-7
Advances in Computer Games
Cham
Springer International Publishing
Winands
Mark H.M.
van den Herik
H. Jaap
Kosters
Walter A.
Bouzy
Bruno
Playing Hanabi Near-Optimally
2017
DOI.org (Crossref)
http://link.springer.com/10.1007/978-3-319-71649-7_5
2020-07-21 11:02:53
Series Title: Lecture Notes in Computer Science
DOI: 10.1007/978-3-319-71649-7_5
51-62
conferencePaper
ISBN 978-1-5386-3233-8
2017 IEEE Conference on Computational Intelligence and Games (CIG)
DOI 10.1109/CIG.2017.8080417
New York, NY, USA
IEEE
Eger
Markus
Martens
Chris
Cordoba
Marcela Alfaro
An intentional AI for hanabi
8/2017
DOI.org (Crossref)
http://ieeexplore.ieee.org/document/8080417/
2020-07-21 11:03:36
68-75
2017 IEEE Conference on Computational Intelligence and Games (CIG)
attachment
Full Text
https://zero.sci-hub.se/6752/bcf6e994ee7503ab821bd67848727b05/eger2017.pdf#view=FitH
2020-07-21 11:03:40
1
application/pdf
conferencePaper
Osawa
Hirotaka
Solving Hanabi: Estimating Hands by Opponent's Actions in Cooperative Game with Incomplete Information
A unique behavior of humans is modifying one’s unobservable behavior based on the reaction of others for cooperation. We used a card game called Hanabi as an evaluation task of imitating human reflective intelligence with artificial intelligence. Hanabi is a cooperative card game with incomplete information. A player cooperates with an opponent in building several card sets constructed with the same color and ordered numbers. However, like a blind man's bluff, each player sees the cards of all other players except his/her own. Also, communication between players is restricted to information about the same numbers and colors, and the player is required to read his/his opponent's intention with the opponent's hand, estimate his/her cards with incomplete information, and play one of them for building a set. We compared human play with several simulated strategies. The results indicate that the strategy with feedbacks from simulated opponent's viewpoints achieves more score than other strategies.
2015
https://aaai.org/ocs/index.php/WS/AAAIW15/paper/view/10167
AAAI Workshops
attachment
Osawa - 2015 - Solving Hanabi Estimating Hands by Opponent's Act.pdf
application/pdf
journalArticle
Cape Cod
Eger
Markus
Martens
Chris
A Browser-based Interface for the Exploration and Evaluation of Hanabi AIs
2017
en
Zotero
http://fdg2017.org/papers/FDG2017_demo_Hanabi.pdf
4
<p>URL: http://fdg2017.org/papers/FDG2017_demo_Hanabi.pdf</p>
attachment
Eger and Martens - 2017 - A Browser-based Interface for the Exploration and .pdf
application/pdf
journalArticle
Gottwald
Eva Tallula
Eger
Markus
Martens
Chris
I see what you see: Integrating eye tracking into Hanabi playing agents
Humans’ eye movements convey a lot of information about their intentions, often unconsciously. Intelligent agents that cooperate with humans in various domains can benefit from interpreting this information. This paper contains a preliminary look at how eye tracking could be useful for agents that play the cooperative card game Hanabi with human players. We outline several situations in which an AI agent can utilize gaze information, and present an outlook on how we plan to integrate this with reimplementations of contemporary Hanabi agents.
en
Zotero
4
<p>URL: <a href="http://www.exag.org/wp-content/uploads/2018/10/AIIDE-18_Upload_112.pdf">http://www.exag.org/wp-content/uploads/2018/10/AIIDE-18_Upload_112.pdf</a></p>
<p> </p>
attachment
Gottwald et al. - I see what you see Integrating eye tracking into .pdf
application/pdf
computerProgram
State of the art Hanabi bots + simulation framework in rust
https://github.com/WuTheFWasThat/hanabi.rs
computerProgram
A strategy simulator for the well-known cooperative card game Hanabi
https://github.com/rjtobin/HanSim
computerProgram
A framework for writing bots that play Hanabi
https://github.com/Quuxplusone/Hanabi
Diplomacy
Hanabi
Kingdomino
Mafia
Magic: The Gathering
Mobile Games
2048
2048
Monopoly
Monopoly Deal
Nmbr9
Patchwork
Quixo
Race for the Galaxy
RISK
Set
Settlers of Catan
Terra Mystica
UNO
Yahtzee