summaryrefslogtreecommitdiff
path: root/old/published/poker-interview-shacfer.txt
diff options
context:
space:
mode:
Diffstat (limited to 'old/published/poker-interview-shacfer.txt')
-rw-r--r--old/published/poker-interview-shacfer.txt48
1 files changed, 0 insertions, 48 deletions
diff --git a/old/published/poker-interview-shacfer.txt b/old/published/poker-interview-shacfer.txt
deleted file mode 100644
index eaf3b0d..0000000
--- a/old/published/poker-interview-shacfer.txt
+++ /dev/null
@@ -1,48 +0,0 @@
-
-
-Schafer
-
-turned over the
-
-organized the event michael bolling
-
-Poker
-
-Th difference betwwen games
-
-there is no randomness in chess and checkers
-
-CCB are perfect information, when you look at the board you know everything you need to know, poker is an imperfect info, you don't know the person's cards.
-
-luck and randomness:
-
-Even I could beat the world champion if I got the right cards.
-
-It's an algorythem, but completely different than for say a chess program.
-
-Poker is a harder problem than chess because
-
-The winning recipe for chess, depended on speed
-
-The problem with poker is that we don't have a winning recipe. There are currently five or six recipes, but none of them are the obvious winning stradegy for building
-
-AI
-
-Nash equilibrum programs these are the strongest that we have right now. They don't learn.
-
-eb:
-
-rock paper sciccers: The nash e l stradegy, is garenteed to never lose. Int he long run stastically you win. I win and we tie 1/3
-
-garenteed not to loose.
-
-oblivious to the opponent
-
-if you have obvious tells, the program is incapable of taking advantage of that and exploiting it. It will play strong poker, but it won't addapt to your playing.
-
-The future is with programs that learn. Exploitive programs.
-
-It's a very heard problem to solve. We're still looking for the magic recipes.
-
-Some of the programs that applied in Vancover
-