Next: About this document
Up: Computer Poker
Previous: Problems for Future
References
- 1
- D F Beal (editor), Advances in Computer Chess,
Edinburgh University Press, Edinburgh, Scotland, (1977-).
- 2
- H Kuhn and A W Tucker (editors), Contributions to
the Theory of Games, vol.1, Princeton University Press, (1950).
- 3
- H Kuhn and A W Tucker (editors), Contributions to
the Theory of Games, vol.2, Princeton University Press, (1953).
- 4
- H Kuhn and A W Tucker (editors), Contributions to
the Theory of Games, vol.3, Princeton University Press, (1957).
- 5
- D N L Levy (editor), Computer Games, vol.1,
Springer-Verlag, New York, (1988).
- 6
- D N L Levy (editor), Computer Games, vol.2,
Springer-Verlag, New York, (1988).
- 7
- D N L Levy and D F Beal (editors), Heuristic
Programming in Artificial Intelligence - The First Computer Olympiad,
Ellis Horwood Limited, Chichester, England, (1989).
- 8
- D N L Levy and D F Beal (editors), Heuristic
Programming in Artificial Intelligence 2 - The Second Computer Olympiad,
Ellis Horwood Limited, Chichester, England, (1990).
- 9
- H J van den Herik and L V Allis (editors), Heuristic
Programming in Artificial Intelligence 3 - The Third Computer Olympiad,
Ellis Horwood Limited, Chichester, England, (1992).
- 10
- H J van den Herik (editor-in-chief), International
Computer Chess Association (ICCA) Journal, University of Limburg, Delft,
Netherlands, (1983-).
- 11
- T A Marsland and J Schaeffer (editors), Computers,
Chess, and Cognition, Springer-Verlag, New York, (1990).
- 12
- R Levinson and S Epstein (editors) Proceedings of the
AAAI Fall Symposium on Games: Planning and Learning, AAAI Press Technical
Report FS93-02, Menlo Park CA, (1993), 59-67.
- 13
- J D Allen, A Note on the Computer Solution of
Connect-Four, Heuristic Programming in Artificial Intelligence 1,
[7], (1989), 134-135.
- 14
- L V Allis, A Knowledge-based Approach of
Connect-Four. The game is solved: White wins, M.Sc. Thesis, Free
University, Amsterdam, The Netherlands, (1988).
- 15
- L V Allis, M van der Meulen, and H J van den Herik,
Databases in Awari, Heuristic Programming in Artificial Intelligence
2, [8] (1990), 73-86.
- 16
- L V Allis and P N A Schoo, Qubic Solved Again,
Heuristic Programming in Artificial Intelligence 3, [9]
(1992), 192-204.
- 17
- L V Allis, H J van den Herik, and M P H Huntjens
Go-Moku Solved by New Search Techniques, Proceedings of the 1993
AAAI Fall Symposium on Games: Planning and Learning, AAAI Press
Technical Report FS93-02, Menlo Park CA, (1993).
- 18
- L V Allis, Searching for Solutions in Games and
Artificial Intelligence, PhD thesis, Vrije Universteit, Amsterdam,
Netherlands, (1994).
- 19
- L V Allis, M van der Menlen, and H J van den Herik
Proof-Number Search, Artificial Intelligence 66, no.1, (1994),
91-124.
- 20
- N C Ankeny, Poker Strategy: Winning with Game
Theory, Basic Books, Inc., New York, (1981).
- 21
- D B Benson, Life in the Game of Go,
Information Sciences 10, no.1, (1976), 17-29. (Reprinted [6], pp
203-213).
- 22
- E R Berlekamp, Programs for Double-Dummy Bridge
Problems - A New Strategy for Mechanical Game Playing, Journal of
the ACM 10, no.4, (1963), 357-364.
- 23
- E R Berlekamp, J H Conway, and R K Guy, Winning
Ways for your Mathematical Plays I, Academic Press, London, England,
(1982).
- 24
- E R Berlekamp, J H Conway, and R K Guy, Winning
Ways for your Mathematical Plays II, Academic Press, London, England,
(1982).
- 25
- H J Berliner, Backgammon Computer Program Beats
World Champion, Computer Games 1, [5] (1980), 29-43.
- 26
- J R S Blair, D Mutchler, and C Lin, Games with
Imperfect Information, Proceedings of the AAAI Fall Symposium on
Games: Planning and Learning, AAAI Press Technical Report FS93-02, Menlo
Park CA, (1993), 59-67.
- 27
- D Brunson, in collaboration with B Baldwin, M Caro, J
Hawthorne, D Reese, and D Sklansky, Super/System: A Course in Power
Poker, B & G Publishing Co, Inc., Las Vegas NV, (1978).
- 28
- J Case (aka W Hyde) and S Jacobs, Percentage
Hold'em: The Book of Numbers, The Monitor, Salt Lake City UT (with
Whitestone Books, San Jose CA), (1993).
- 29
- K Chen, Group Identification in Computer Go,
Heuristic Programming in Artificial Intelligence 1, [7], (1989),
195-210.
- 30
- K Chen, A Kierulf, M Muller and J Nievergelt, The
Design and Evolution of Go Explorer, Computers, Chess, and
Cognition, [11] (1990), 271-285.
- 31
- K Chen, Attack and Defense, Heuristic
Programming in Artificial Intelligence 3, [9] (1992), 146-156.
- 32
- W H Cutler, An Optimal Strategy for Pot-Limit Poker,
American Math Monthly 82, (1975), 368-376.
- 33
- R A Epstein, The Theory of Gambling and Statistical
Logic, Academic Press, New York (1977).
- 34
- N V Findler, Programming Games, Summarized
Proceedings of the First Conference on Automatic Computing and Data
Processing, Australia, (1961), paper B1, 3.3.
- 35
- N V Findler, Computer Model of Gambling and Bluffing,
IRE Transactions on Electronic Computers, vol.EC-10, no.1, (1961),
5-6. (Reprinted in [6], pp 409-412).
- 36
- N V Findler, Some New Approaches to Machine
Learning, IEEE Transactions on Systems Sciences and Cybernetics,
vol.SSC-5, no.3, (1969), 173-182. (Reprinted in [6], pp 304-324).
- 37
- N V Findler, H Klein, W Gould, A Kowal, and J Menig
Studies on Decision Making Using the Game of Poker, Proceedings of
IFIP Congress 1971, (1972), 1448-1459. (Reprinted in [6], pp
413-429).
- 38
- N V Findler, H Klein, and Z Levine Experiments with
inductive discovery processes leading to heuristics in a poker program,
Proceedings of Conference on Cognitive Systems, Springer-Verlag,
Berlin, (1973), 257-266.
- 39
- N V Findler, H Klein, R C Johnson, A Kowal, Z Levine,
and J Menig, Heuristic programmers and their gambling machines,
Proceedings of the ACM National Conference, San Diego CA, (1974),
28-37.
- 40
- N V Findler, Studies in Machine Cognition Using the
Game of Poker, Communications of the ACM 20, no.4, (1977),
230-245. (Reprinted in [6], pp 430-460).
- 41
- N V Findler, Computer Poker, Scientific
American, July (1978), 112-119.
- 42
- N V Findler, Aspects of Computer Learning,
Cybernetic Systems 11, no.1-2 (1980), 67-86.
- 43
- A Frank, Brute Force Search in Games of Imperfect
Information, Heuristic Programming in Artificial Intelligence 2,
[8] (1990), 204-209.
- 44
- B Gamback, M Rayner, and B Pell, An Architecture for
a Sophisticated Mechanical Bridge Player, Heuristic Programming in
Artificial Intelligence 2, [8] (1990), 87-107.
- 45
- R Gasser, Applying Retrograde Analysis to Nine Men's
Morris, Heuristic Programming in Artificial Intelligence 2,
[8] (1990), 161-173.
- 46
- R Gasser, Heuristic Search and Retrograde Analysis:
their application to Nine Men's Morris, Diploma thesis, Swiss Federal
Institute of Technology, Zurich, Switzerland, (1990).
- 47
- J Gnodde, Aida, New Search Techniques Applied to
Othello, M.Sc. Thesis, University of Leiden, Netherlands, (1993).
- 48
- M R Hall and D E Loeb, Thoughts on Programming a
Diplomat, Heuristic Programming in Artificial Intelligence 3,
[9] (1992), 123-145.
- 49
- F-h Hsu, T S Anantharaman, M S Cambell and A Nowatzyk,
Deep Thought, Computers, Chess, and Cognition, [11],
(1990), 55-78.
- 50
- L Jones, Winning Low-Limit Hold'em, ConJelCo,
Pittsburgh PA, (1994).
- 51
- S Karlin and R Restrepo, Multistage Poker Models,
Contributions to the Theory of Games, vol.3 [4], Princeton
University Press, (1957), 337-364.
- 52
- S Karlin, Mathematical Methods and Theory in Games,
Programming and Economics, vol.2, Pergamon Press, London, (1959).
- 53
- A Kierulf, K H Chen and J Nievergelt, Smart Game Board
and Go Explorer: A Case Study in Software and Knowledge Engineering,
Communications of the ACM, 33, no.2, (1990), 152-166.
- 54
- R Lake, J Schaeffer, and P Lu, Solving Large
Retrograde Analysis Problems Using a Network of Workstations, TR
93-13, Department of Computing Science, University of Alberta, (1993).
- 55
- D N L Levy, The Million Pound Bridge Problem,
Heuristic Programming in Artificial Intelligence 1, [7] (1989),
pp 95-103.
- 56
- E T Lindelof, COBRA - The Computer Designed Bidding
System, Gollancz, London, England, (1983).
- 57
- J M MacLeod, MICROBRIDGE - A Computer Developed
Approach to Bidding, Heuristic Programming in Artificial Intelligence
1, [7] (1989), 81-87.
- 58
- M Malmuth, Gambling Theory and Other Topics,
Two Plus Two Publishing, Las Vegas NV, (1987) (1994 4th ed).
- 59
- M Malmuth, Winning Concepts in Draw and Lowball,
Two Plus Two Publishing, Las Vegas NV.
- 60
- M Malmuth, Poker Essays, Two Plus Two Publishing,
Las Vegas NV.
- 61
- J F Nash and L S Shapley, A Simple Three-Person Poker
Game, Contributions to the Theory of Games, vol.1 [2],
Princeton University Press, (1950), 105-116.
- 62
- D J Newman, A model for ``real'' poker,
Oper. Res. 7, (1959), 557-560.
- 63
- O Patashnik, Qubic: 4x4x4 Tic-Tac-Toe,
Mathematics Magazine 53, (1980), 202-216.
- 64
- B Pell, Exploratory Learning in the Game of GO:
Initial Results, Heuristic Programming in Artificial Intelligence
2, [8], (1990), 137-152.
- 65
- R Popma and L V Allis, Life and Death Refined,
Heuristic Programming in Artificial Intelligence 3, [9] (1992),
157-164.
- 66
- P S Rosenbloom, A World-Championship-Level Othello
Program, Computer Games 2, [6] (1979), 365-408.
- 67
- J L Ryder, Heuristic analysis of large trees as
generated in the game of Go, Ph.D. Thesis, Stanford University, (1971).
- 68
- M Sakaguchi and S Sakai, Partial Information in a
Simplified Two-Person Poker, Math. Japonica 26, no.6, (1981),
695-705.
- 69
- M Sakaguchi, A Simplified Two-Person Multistage Poker
with Optional Stopping, Math. Japonica 28, no.3 (1983), 287-303.
- 70
- M Sakaguchi, A Note on the Disadvantage for the Sente
Player in Poker, Math. Japonica 29, no.3 (1984), 483-489.
- 71
- M Sakaguchi, On Two-Person ``Real'' Poker by Newman,
Math. Japonica 30, no.3 (1985), 471-483.
- 72
- M Sakaguchi, Information Contained in Face-up Cards
in Poker, Math. Japonica 30, no.4 (1985), 535-549.
- 73
- M Sakaguchi, The Value of Sample Information in
High-Hand-Wins Poker, Math. Japonica 33, (1988), 587-607.
- 74
- M Sakaguchi, The Value of Sample Information in
La Relance Poker, Math. Japonica 33, (1988), 777-800.
- 75
- M Sakaguchi and S Sakai, Multistage Poker with Random
Amount of Bets, Math. Japonica 37, no.5, (1992), 827-838.
- 76
- M Sakaguchi and S Sakai, Solutions of Some
Three-Person Stud and Draw Poker, Math. Japonica 37, no.6, (1992),
1147-1160.
- 77
- S Sakai, A model for real poker with an upper bound of
assets, Journal Optim. Theory Appl. 50, no.1, (1986), 149-163.
- 78
- J Schaeffer, J Culbertson, N Treloar, B Knight, P Lu, and
D Szafron, Reviving the Game of Checkers, Heuristic Programming
in Artificial Intelligence 2, [8] (1990), 119-136. (Also
available as a University of Alberta Computer Science department technical
report).
- 79
- J Schaeffer, J Culbertson, N Treloar, B Knight, P Lu, and
D Szafron, A World Championship Caliber Checkers Program,
Artificial Intelligence 53, no.2-3, (1992), 273-290.
- 80
- J Schaeffer, Man Versus Machine: The Silicon
Graphics World Checkers Championship, TR 92-19, Department of
Computing Science, University of Alberta, (1992).
- 81
- J Schaeffer, N Treloar, P Lu, and R Lake,
Man Versus Machine for the World Checkers Championship, AI Magazine
14, no.2, (1993), 28-35. (An abbreviated version of this article also
appeared in the ICCA Journal [10], vol.16, no.2, 105-110).
- 82
- J Schaeffer, A Re-examination of Brute-Force
Search, Proceedings of the AAAI Fall Symposium on Games: Planning
and Learning, AAAI Press Technical Report FS93-02, Menlo Park CA,
(1993), 51-58.
- 83
- P N A Schoo, Optimal Play in a Single Bridge Suit, in
preparation.
- 84
- S C Shapiro and H R Smith, A Scrabble Crossword
Game-Playing Program, Computer Games 1, (1977), 403-422.
- 85
- K Shirayanagi, Knowledge Representation and its
Refinement in Go Programs, Computers, Chess, and Cognition,
[11] (1989), 287-300.
- 86
- D Sklansky, Hold'em Poker, Gambler's Book Club, Las
Vegas NV, (1976).
- 87
- D Sklansky, The Theory of Poker, (formerly titled
``Winning Poker''), Two Plus Two Publishing, Las Vegas NV, (1987) (1992
3rd ed).
- 88
- D Sklansky, Sklansky on Poker, Two Plus Two
Publishing, Las Vegas NV.
- 89
- D Sklansky, Getting the Best of It, Two Plus Two
Publishing, Las Vegas NV.
- 90
- D Sklansky and M Malmuth, Hold'em Poker for
Advanced Players, Two Plus Two Publishing, Las Vegas NV, (1988) (1994 2nd
ed).
- 91
- D Sklansky, M Malmuth and R Zee, Seven-Card Stud
for Advanced Players, Two Plus Two Publishing, Las Vegas NV.
- 92
- L Stiller, Parallel Analysis of Certain Endgames,
ICCA Journal 12, [10] no.2, (1989), 55-64.
- 93
- G Tesauro, NEUROGAMMON: A Neural-Network Backgammon
Learning Program, Heuristic Programming in Artificial Intelligence
1, [7] (1989), 78-80.
- 94
- G Tesauro, TD-Gammon, A Self-Teaching Backgammon
Program, Achieves Master-Level Play, Proceedings of the AAAI Fall
Symposium on Games: Planning and Learning, AAAI Press Technical Report
FS93-02, Menlo Park CA, (1993), 19-23.
- 95
- K Thompson, Retrograde Analysis of Certain Endgames,
ICCA Journal 9, [10] no.3, (1986), 131-139.
- 96
- E O Thorp, and W E Walden, A Computer-Assisted Study
of Go on M x N Boards, Computer Games 2, [6] (1972), 152-181.
- 97
- T Throop and T Guilfoyle, A Thrilling Hand,
Heuristic Programming in Artificial Intelligence 3, [9] (1992),
27-28.
- 98
- J W H M Uiterwyk, H J van den Herik, and V Allis,
Knowledge-Based Approach to Connect Four. The Game is Over: White to
Move Wins!, Heuristic Programming in Artificial Intelligence 1,
[7] (1989), 113-133.
- 99
- J W H M Uiterwijk, Knowledge and Strategies in
Go-Moku, Heuristic Programming in Artificial Intelligence 3,
[9] (1992), 165-179.
- 100
- I H Ulgee, Letters beyond Numbers, Heuristic
Programming in Artificial Intelligence 3, [9] (1992), 63-66.
- 101
- J von Neumann and O Morgenstern, Theory of Games and
Economic Behavior, Princeton Univ. Press, Princeton, (1944).
- 102
- R Wheen, Brute Force Programming for Solving Double
Dummy Bridge Problems, Heuristic Programming in Artificial
Intelligence 1, [7] (1989), 88-94.
- 103
- B Wilcox, Reflections on Building Two Go Programs,
SIGART News 94, (1985), 29-43.
- 104
- N Zadeh, PhD thesis, University of California at
Berkeley, (1972).
- 105
- N Zadeh, Winning Poker Systems, Prentice Hall,
Inc., Englewood Cliffs, NJ, (1974).
- 106
- N Zadeh, Computation of optimal poker strategies,
Operations Res. 25, no.4, (1977), 541-562.
- 107
- R Zee, High-Low-Split Poker, Seven-Card Stud and
Omaha Eight-or-Better for Advanced Players, Two Plus Two Publishing, Las
Vegas NV.
- 108
- A L Zobrist, Feature extraction and representation
for pattern recognition and the game of Go, Ph.D. Thesis, U of Wisconsin,
(1970).
- 109
- A Andrews, Seven-Card-Stud Poker for Windows,
rec.gambling.poker Berkely Archive Site [126], 7crdstd2.zip.
(More recent versions also available).
- 110
- S Brecher, IRC .ircrc Configuration File,
rec.gambling.poker Berkely Archive Site [126], ircrc.poker.
- 111
- M Maurer, Simulation Data for Various Poker Games,
available from the author [117].
- 112
- R T Hashimoto, A Poker Hand Distribution Generator:
fish.c, rec.gambling.poker Berkely Archive Site [126], fish.c.
- 113
- C T Matthews, Rewrite of Hashimoto's fish.c,
rec.gambling.poker Berkely Archive Site [126], poker.tar.gz,
or anonymous FTP site: ``ftp.cs.unm.edu/pub/poker/poker.tar.gz''.
- 114
- C T Matthews, K Miyake, M Hostetter, Very Fast
Poker Hand Comparators, rec.gambling.poker Berkely Archive Site
[126], poker.tar.gz, or anonymous FTP site:
``ftp.cs.unm.edu/pub/poker/poker.tar.gz''.
- 115
- Gambler's Book Club catalogue, Gambler's Book
Club, Las Vegas NV. Better program titles include: ``Workware Master
Series Hold'em'', ``Wilson Software Turbo Texas Hold'em'', ``Szobodan
Seven-Card Stud'', and ``The World Series of Poker Adventure''.
- 116
- M Maurer, IRC Poker Database, WWW Address:
``http://www-star.stanford.edu/ maurer/r.g/''.
- 117
- M Maurer, WWW Home Page, WWW Address:
``http://www-star.stanford.edu/ maurer/''.
- 118
- M Maurer, Bankroll Variance as a Function of Game
Size, WWW Address:
``http://www-star.stanford.edu/ maurer/r.g/pstats4.html''.
- 119
- M Maurer, Profit Rate as a Function of Position and
Game Size, WWW Address:
``http://www-star.stanford.edu/ maurer/r.g/pstats5.html''.
- 120
- M Maurer, Player Strategy Statistics: Abridged Set,
WWW Address: ``http://www-star.stanford.edu/ maurer/r.g/psort2.html''.
- 121
- M Maurer, IRC Observer Bot Source Code, WWW
Address: ``http://www-star.stanford.edu/ maurer/r.g/pobot'' (etc).
- 122
- M Maurer, IRC Bot Poker Player, WWW Address:
``http://www-star.stanford.edu/ maurer/r.g/pmaubot''.
- 123
- M Maurer, A Study of Variance Using the IRC Poker
Database, WWW Address:
``http://www.conjelco.com/r_g/las_vegas/variance_3-6.html''.
- 124
- T Mummert, An IRC Poker Dealing Program, IRC Server
location: ``vegas.scandal.cs.cmu.edu 6667'', WWW Address:
``http://www.cs.cmu.edu/ mummert/ircbot.html''.
- 125
- H Ruegg, 7-Card Stud and Texas Hold'em Simulations,
rec.gambling.poker Berkely Archive Site [126], spoker.tar.Z
- 126
- Usenet newsgroup rec.gambling.poker, Berkeley
Archive Site, WWW Address:
``ftp://ftp.csua.berkeley.edu/pub/rec.gambling/poker''
(note: maximum of 15 anonymous users).
- 127
- Usenet newsgroup rec.gambling.poker, UIUC Archive
Site, WWW Address:
``gopher://gopher.uiuc.edu/1ftp
- 128
- Usenet newsgroup rec.gambling.poker, Frequently
Asked Questions (FAQ), WWW Address:
``http://www.conjelco.com/faq/poker.html''.
- 129
- Usenet newsgroup rec.gambling.poker, WWW Home
Page, WWW Address: ``http://www.conjelco.com/r.g.html''.
& Schaeffer
Thu Feb 12 14:00:05 MST 1998