Difference between revisions of "Games"

From Chessprogramming wiki
Jump to: navigation, search
(8 intermediate revisions by 2 users not shown)
Line 54: Line 54:
 
* [[Chinese Dark Chess]]
 
* [[Chinese Dark Chess]]
 
* [[KriegSpiel]]
 
* [[KriegSpiel]]
 +
* [[Jeiqi]]
 
* [[Phantom Go]]
 
* [[Phantom Go]]
  
Line 192: Line 193:
 
* [[Cherif R. S. Andraos]], [[Manal M. Zaky]], [[Salma A. Ghoneim]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_19 Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types]''. [[CG 2006]]
 
* [[Cherif R. S. Andraos]], [[Manal M. Zaky]], [[Salma A. Ghoneim]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_19 Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types]''. [[CG 2006]]
 
* [[Aviezri Fraenkel]] ('''2006'''). ''Nim is Easy, Chess is Hard – But Why??'' [[ICGA Journal#29_4|ICGA Journal, Vol. 29, No. 4]], [http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/ICGA.pdf pdf]
 
* [[Aviezri Fraenkel]] ('''2006'''). ''Nim is Easy, Chess is Hard – But Why??'' [[ICGA Journal#29_4|ICGA Journal, Vol. 29, No. 4]], [http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/ICGA.pdf pdf]
* [[Mathematician#RHearn|Robert Aubrey Hearn]] ('''2006'''). ''Games, Puzzles, and Computation''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisors: [[Erik D. Demaine]], [[Mathematician#Sussman|Gerald Jay Sussman]], [http://groups.csail.mit.edu/mac/users/bob/hearn-thesis-final.pdf pdf]
+
* [[Mathematician#RHearn|Robert A. Hearn]] ('''2006'''). ''Games, Puzzles, and Computation''. Ph.D. thesis, [[Massachusetts Institute of Technology]], advisors: [[Erik D. Demaine]], [[Mathematician#Sussman|Gerald Jay Sussman]], [http://groups.csail.mit.edu/mac/users/bob/hearn-thesis-final.pdf pdf]
 
* [[Jill Cirasella]], [[Danny Kopec]] ('''2006'''). ''The History of Computer Games''. [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/computer_games_handout.pdf pdf]
 
* [[Jill Cirasella]], [[Danny Kopec]] ('''2006'''). ''The History of Computer Games''. [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/computer_games_handout.pdf pdf]
 
* [[Nicolò Cesa-Bianchi]], [[Gábor Lugosi]] ('''2006'''). ''[http://homes.di.unimi.it/~cesabian/predbook/ Prediction, Learning, and Games]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
 
* [[Nicolò Cesa-Bianchi]], [[Gábor Lugosi]] ('''2006'''). ''[http://homes.di.unimi.it/~cesabian/predbook/ Prediction, Learning, and Games]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
Line 214: Line 215:
 
* [[Richard Zhao]], [[Duane Szafron]] ('''2009'''). ''Learning Character Behaviors Using Agent Modeling in Games''. [http://dblp.uni-trier.de/db/conf/aiide/aiide2009.html#ZhaoS09 AIIDE 2009], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5041 CiteSeerX]
 
* [[Richard Zhao]], [[Duane Szafron]] ('''2009'''). ''Learning Character Behaviors Using Agent Modeling in Games''. [http://dblp.uni-trier.de/db/conf/aiide/aiide2009.html#ZhaoS09 AIIDE 2009], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5041 CiteSeerX]
 
* [[Maria Cutumisu]], [[Duane Szafron]] ('''2009'''). ''An Architecture for Game Behavior AI: Behavior Multi-Queues''. [http://dblp.uni-trier.de/db/conf/aiide/aiide2009.html AIIDE 2009], [https://webdocs.cs.ualberta.ca/~duane/publications/pdf/2009aiideMC.pdf pdf]
 
* [[Maria Cutumisu]], [[Duane Szafron]] ('''2009'''). ''An Architecture for Game Behavior AI: Behavior Multi-Queues''. [http://dblp.uni-trier.de/db/conf/aiide/aiide2009.html AIIDE 2009], [https://webdocs.cs.ualberta.ca/~duane/publications/pdf/2009aiideMC.pdf pdf]
 +
* [[Mathematician#RHearn|Robert A. Hearn]], [[Erik D. Demaine]] ('''2009'''). ''[http://erikdemaine.org/papers/GPC/ Games, Puzzles, and Computation]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
 
==2010 ...==  
 
==2010 ...==  
 
* [[Alessandro Cincotti]] ('''2010'''). ''N-player partizan games''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Compututer Science], Vol. 411, No. 34-36, [https://en.wikipedia.org/wiki/Digital_object_identifier doi]: [http://www.sciencedirect.com/science/article/pii/S0304397510003105 10.1016/j.tcs.2010.05.018]
 
* [[Alessandro Cincotti]] ('''2010'''). ''N-player partizan games''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Compututer Science], Vol. 411, No. 34-36, [https://en.wikipedia.org/wiki/Digital_object_identifier doi]: [http://www.sciencedirect.com/science/article/pii/S0304397510003105 10.1016/j.tcs.2010.05.018]
Line 241: Line 243:
 
* [[David W. King]] ('''2014'''). ''Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas''. Masters thesis, [https://en.wikipedia.org/wiki/Air_Force_Institute_of_Technology Air Force Institute of Technology], [http://www.afit.edu/docs/AFIT-ENG-14-M-44_King.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Crossings_%28game%29 Crossings from Wikipedia]</ref>
 
* [[David W. King]] ('''2014'''). ''Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas''. Masters thesis, [https://en.wikipedia.org/wiki/Air_Force_Institute_of_Technology Air Force Institute of Technology], [http://www.afit.edu/docs/AFIT-ENG-14-M-44_King.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Crossings_%28game%29 Crossings from Wikipedia]</ref>
 
* [[David W. King]], [[Gilbert L. Peterson]] ('''2014'''). ''Epaminondas: Exploring Combat Tactics''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] <ref> [https://en.wikipedia.org/wiki/Epaminondas_%28game%29 Epaminondas from Wikipedia]</ref>
 
* [[David W. King]], [[Gilbert L. Peterson]] ('''2014'''). ''Epaminondas: Exploring Combat Tactics''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] <ref> [https://en.wikipedia.org/wiki/Epaminondas_%28game%29 Epaminondas from Wikipedia]</ref>
 +
* [[Christopher D. Rosin]] ('''2014'''). ''Game playing''. [https://en.wikipedia.org/wiki/Wiley_Interdisciplinary_Reviews:_Cognitive_Science WIREs Cognitive Science], Vol. 5, [http://www.chrisrosin.com/Rosin-Game-Playing-submitted-ver.pdf pdf preprint]
 
==2015 ...==
 
==2015 ...==
 
* [[Cameron Browne]] (ed.) ('''2015'''). ''[http://www.cameronius.com/gapd/issues/ Game & Puzzle Design, Vol. 1, No. 1]''.  
 
* [[Cameron Browne]] (ed.) ('''2015'''). ''[http://www.cameronius.com/gapd/issues/ Game & Puzzle Design, Vol. 1, No. 1]''.  
Line 252: Line 255:
 
* [[Todd W. Neller]] et al. ('''2016'''). ''Monte Carlo Approaches to Parameterized Poker Squares''. [[CG 2016]] <ref>[http://cs.gettysburg.edu/~tneller/games/pokersquares/eaai/ Poker Squares (a.k.a. Poker Solitaire, Poker Square, Poker Patience)]</ref>
 
* [[Todd W. Neller]] et al. ('''2016'''). ''Monte Carlo Approaches to Parameterized Poker Squares''. [[CG 2016]] <ref>[http://cs.gettysburg.edu/~tneller/games/pokersquares/eaai/ Poker Squares (a.k.a. Poker Solitaire, Poker Square, Poker Patience)]</ref>
 
* [[Johannes Heinrich]], [[David Silver]] ('''2016'''). ''Deep Reinforcement Learning from Self-Play in Imperfect-Information Games''. [https://arxiv.org/abs/1603.01121 arXiv:1603.01121]  
 
* [[Johannes Heinrich]], [[David Silver]] ('''2016'''). ''Deep Reinforcement Learning from Self-Play in Imperfect-Information Games''. [https://arxiv.org/abs/1603.01121 arXiv:1603.01121]  
 +
* [[David L. St-Pierre]], [[Jean-Baptiste Hoock]], [[Jialin Liu]], [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2016'''). ''Automatically Reinforcing a Game AI''. [https://arxiv.org/abs/1607.08100 arXiv:1607.0810] » [[Monte-Carlo Tree Search|MCTS]]
 
'''2017'''
 
'''2017'''
 
* [[Jakub Kowalski]], [[Jakub Sutowicz]], [[Marek Szykuła]] ('''2017'''). ''Regular Boardgames''. [https://arxiv.org/abs/1706.02462 arXiv:1706.02462]
 
* [[Jakub Kowalski]], [[Jakub Sutowicz]], [[Marek Szykuła]] ('''2017'''). ''Regular Boardgames''. [https://arxiv.org/abs/1706.02462 arXiv:1706.02462]
Line 264: Line 268:
  
 
=Forum Posts=
 
=Forum Posts=
==2005 ...==
+
==1990 ...==
 +
* [https://groups.google.com/d/msg/rec.games.chess/dkvZ38gzk-8/TiJTI6c2A-IJ Chess is not solvable] by Teri A. Meyers, [[Computer Chess Forums|rgc]], September 23, 1992
 +
* [https://groups.google.com/d/msg/rec.games.chess/xE0LXST4cE0/pMHY9BYQbKMJ Solvability] by Teri A. Meyers, [[Computer Chess Forums|rgc]], September 30, 1992
 +
* [https://groups.google.com/d/msg/rec.games.chess/3bGv1yI1uE0/j2PU-DY7iXgJ Computer solvability of games] by Scott Donaldson, [[Computer Chess Forums|rgc]], February 10, 1993
 +
: [https://groups.google.com/d/msg/rec.games.chess/3bGv1yI1uE0/laxAvO-84TUJ Re: Computer solvability of games] by [[Robert Hyatt]], February 10, 1993
 +
: [https://groups.google.com/d/msg/rec.games.chess/3bGv1yI1uE0/EAkMrqKM8HEJ Re: Computer solvability of games] by [[Paul Lu]], February 11, 1993
 +
: [https://groups.google.com/d/msg/rec.games.chess/3bGv1yI1uE0/Ad2F4PGgt1wJ Re: Computer solvability of games] by [[Paul Hsieh]], [[Computer Chess Forums|rgc]], February 11, 1993
 +
==2000 ...==
 
* [http://www.talkchess.com/forum/viewtopic.php?t=17338 Variants and Board Size] by [[Harm Geert Muller]], [[CCC]], October 25, 2007» [[Games#ChessVariants|Chess Variants]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=17338 Variants and Board Size] by [[Harm Geert Muller]], [[CCC]], October 25, 2007» [[Games#ChessVariants|Chess Variants]]
 
==2010 ...==
 
==2010 ...==
Line 455: Line 466:
 
: [http://www.althofer.de/dawn-11-15.html DAWN 11/15 A game of strategy for two players, on the current asteroid mission of NASA] by [[Ingo Althöfer]]
 
: [http://www.althofer.de/dawn-11-15.html DAWN 11/15 A game of strategy for two players, on the current asteroid mission of NASA] by [[Ingo Althöfer]]
 
* [https://en.wikipedia.org/wiki/Hans_Magnus_Enzensberger Hans Magnus Enzensberger] ('''1997'''). [https://en.wikipedia.org/wiki/The_Number_Devil The Number Devil] (German: Der Zahlenteufel)
 
* [https://en.wikipedia.org/wiki/Hans_Magnus_Enzensberger Hans Magnus Enzensberger] ('''1997'''). [https://en.wikipedia.org/wiki/The_Number_Devil The Number Devil] (German: Der Zahlenteufel)
* [[:Category:Chick Corea|Chick Corea]] - What Game Shall We Play Today, [https://en.wikipedia.org/wiki/Return_to_Forever_(Chick_Corea_album) Return To Forever] debut album of [[:Category:Return to Forever|Return to Forever]], 1972, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* [[:Category:Chick Corea|Chick Corea]] - What Game Shall We Play Today (Alternate Take 2), [https://en.wikipedia.org/wiki/Return_to_Forever_(Chick_Corea_album) Return To Forever] debut album of [[:Category:Return to Forever|Return to Forever]], 1972, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
:  featuring [[:Category:Stanley Clarke|Stanley Clarke]],  [[:Category:Flora Purim|Flora Purim]], [[:Category:Airto Moreira|Airto Moreira]], and [https://en.wikipedia.org/wiki/Joe_Farrell Joe Farell]
+
:  featuring [[:Category:Stanley Clarke|Stanley Clarke]],  [[:Category:Flora Purim|Flora Purim]], [[:Category:Airto Moreira|Airto Moreira]], and [[:Category:Joe Farrell|Joe Farrell]]
: {{#evu:https://www.youtube.com/watch?v=ZyqyROM6Shw|alignment=left|valignment=top}}
+
: {{#evu:https://www.youtube.com/watch?v=_0DAbUVURKU|alignment=left|valignment=top}}
 
* [[:Category:Casiopea|Casiopea vs. The Square]] - Eccentric Games, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 
* [[:Category:Casiopea|Casiopea vs. The Square]] - Eccentric Games, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 
: {{#evu:https://www.youtube.com/watch?v=gnYZxdCICDw|alignment=left|valignment=top}}
 
: {{#evu:https://www.youtube.com/watch?v=gnYZxdCICDw|alignment=left|valignment=top}}
Line 469: Line 480:
 
[[Category:Stanley Clarke]]
 
[[Category:Stanley Clarke]]
 
[[Category:Chick Corea]]
 
[[Category:Chick Corea]]
 +
[[Category:Joe Farrell]]
 
[[Category:Airto Moreira]]
 
[[Category:Airto Moreira]]
 
[[Category:Flora Purim]]
 
[[Category:Flora Purim]]

Revision as of 14:54, 30 April 2019

Home * Games

John von Neumann classified Chess as two-player zero-sum abstract strategy board game with perfect information. This page gives a brief overview on chess variants and other games, which are interesting for chess programmers due to new and innovative approaches and algorithms in search, evaluation and learning.

Board Games

Chess Variants

Abstract Board Games

Mancala Games

Games of Chance

Without perfect information

Card Games

Single-player

Misc

Game Description Language

See also

Publications

1913

  • Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proc. Fifth Congress Mathematicians, (Cambridge 1912), Cambridge Univ. Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess. [2]

1920 ...

1930 ...

1940 ...

1950 ...

1960 ...

1970 ...

1980 ...

1990 ...

1995 ...

2000 ...

2001

2002

2003

2004

2005 ...

2006

2007

2008

2009

2010 ...

2011

2012

2013

2014

2015 ...

2016

2017

Forum Posts

1990 ...

Re: Computer solvability of games by Robert Hyatt, February 10, 1993
Re: Computer solvability of games by Paul Lu, February 11, 1993
Re: Computer solvability of games by Paul Hsieh, rgc, February 11, 1993

2000 ...

2010 ...

2015 ...

2016

2017

2018

External Links

Type of Games

Sport

Cue sports

Robot sports

Game theory

Complexity

Template: Complexity

Player

Agents

Games Scholars

Workshops & Events

Ingo Althöfer

Pictorial Reports and Games by Ingo Althöfer

Chrilly Donninger, Stefan Meyer-Kahlen, Frank Schneider and Eiko Bleicher et al.

Game Theory

Elwyn Berlekamp, Noam Elkies, Aviezri Fraenkel, Philip Henderson, Martin Müller et al.
Elwyn Berlekamp, Tristan Cazenave, Aviezri Fraenkel, Martin Müller et al.

Organizations

Online

Blogs

Misc

DAWN 11/15 A game of strategy for two players, on the current asteroid mission of NASA by Ingo Althöfer
featuring Stanley Clarke, Flora Purim, Airto Moreira, and Joe Farrell

References

  1. Seirawan chess from Wikipedia
  2. see Appendix in Ulrich Schwalbe, Paul Walker (1997). Zermelo and the early history of game theory. pdf
  3. Alexander Reinefeld (2005). Die Entwicklung der Spielprogrammierung: Von John von Neumann bis zu den hochparallelen Schachmaschinen. slides as pdf, Themen der Informatik im historischen Kontext Ringvorlesung an der HU Berlin, 02.06.2005 (English paper, German title)
  4. Hex is a special case of the Shannon Switching Game, from Jack van Rijswijck (2003). Search and evaluation in Hex. Technical report, University of Alberta, pdf
  5. see Swap-off by Helmut Richter
  6. Donald Knuth (1974). Surreal Numbers - How two ex-students turned on to pure mathematics and found total happiness. Addison-Wesley
  7. Jörg Bewersdorff (2008). Spiele aus mathematischer Sicht. slides as pdf
  8. Lua (programming language) from Wikipedia
  9. Lumines from Wikipedia
  10. Ingo Althöfer (2010). Automatic Generation and Evaluation of Recombination Games. Doctoral Dissertation by Cameron Browne, Review, ICGA Journal, Vol. 33, No. 4
  11. Khet (game) from Wikipedia
  12. A central part of the thesis was published in: Jakob Erdmann (2009). Chanciness: Towards a Characterization of Chance in Games. ICGA Journal, Vol. 32, No. 4
  13. The Foundations of Digital Games covers Blaise Pascal, Gottfried Wilhelm Leibniz, Charles Babbage, Ada Lovelace, Alan Turing, John von Neumann, Edward Condon, Claude Shannon, Donald Michie, and Donald E. Knuth
  14. Dap Hartmann (2013). From to αβ to ABCD and SMAB. Review. ICGA Journal, Vol. 36, No. 4
  15. Game Description Language from Wikipedia
  16. Crossings from Wikipedia
  17. Epaminondas from Wikipedia
  18. Karl's Race A Game on Karl Scherer's Alternating Tiling by Ingo Althöfer, 2006
  19. Marieke Peeters (2014) Personalized Educational Games - Developing agent-supported scenario-based training. Ph.D. thesis, Utrecht University
  20. John Forbes Nash, Jr. from Wikipedia
  21. Poker Squares (a.k.a. Poker Solitaire, Poker Square, Poker Patience)
  22. Puyo Puyo from Wikipedia
  23. Re: Something from the poker domain by Adam Hair, CCC, January 20, 2015
  24. Klein bottle

Up one Level