Voici vite fais un copié collé de mes références pour ce projet si il y en a qui veulent aussi créer leur propre solveur.
[1] https://www.wsop.com/how-to-play-poker/images/how-to-ranking.
jpg. Accessed: 2022-07-02.
[2] Download – GTO+. Accessed: 2022-07-02.
[3] Robert Mattmüller Bernhard Nebel. Game Theory. https://gki.informatik.
uni- freiburg.de/teaching/ss18/gametheory/gametheory10- handout.
pdf. Accessed: 2022-07-02.
[4] Darse Billings et al. “Approximating Game-Theoretic Optimal Strategies for
Full-scale Poker”. In: IJCAI. 2003.
[5] Michael Bowling et al. “Heads-up Limit Hold’em Poker is Solved”. In: Commun. ACM 60.11 (Oct. 2017), pp. 81–88. issn: 0001-0782. doi: 10 . 1145 /
3131284. url: https://doi.org/10.1145/3131284.
[6] Noam Brown and Tuomas Sandholm. “Superhuman AI for heads-up no-limit
poker: Libratus beats top professionals”. In: Science 359 (2018), pp. 418–424.
[7] Neil Burch et al. “AIVAT: A New Variance Reduction Technique for Agent
Evaluation in Imperfect Information Games”. In: CoRR abs/1612.06915 (2016).
arXiv: 1612.06915. url: [1612.06915] AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games.
[8] Kamil Czarnogorski. Counterfactual Regret Minimization - the core of Poker
AI beating professional players. https://int8.io/counterfactual-regretminimization-for-poker-ai/. Accessed: 2022-07-02.
[9] Andrew Gilpin and Tuomas Sandholm. “Lossless Abstraction of Imperfect
Information Games”. In: J. ACM 54.5 (Oct. 2007), 25–es. issn: 0004-5411. doi:
10.1145/1284320.1284324. url: https://doi.org/10.1145/1284320.
1284324.
[10] Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre Sørensen. “Potentialaware automated abstraction of sequential games, and holistic equilibrium
analysis of Texas Hold’em poker”. In: Proceedings of the National Conference
on Artificial Intelligence. Vol. 22. 1. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999. 2007, p. 50.
[11] GTO Wizard. https://app.gtowizard.com/. Accessed: 2022-04-15.
[12] herttaberlin. How many different flops, asks DaVitsche. https://www.unibetcommunity.
com/forums/topic/8812-how-many-different-flops-asks-davitsche/
: ~ : text = There % 20are % 2022100 % 20possible % 20flops , of % 20which %
20are%20strategically%20different. Accessed: 2022-07-02.
[13] Michael Johanson. What is an intuitive explanation of counterfactual regret
minimization? https://www.quora.com/What-is-an-intuitive-explanationof-counterfactual-regret-minimization. Accessed: 2022-07-02.
[14] Michael Johanson et al. “Accelerating Best Response Calculation in Large Extensive Games”. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Volume One. IJCAI’11. Barcelona,
Catalonia, Spain: AAAI Press, 2011, pp. 258–265. isbn: 9781577355137.
[15] Michael Johanson et al. “Efficient Nash equilibrium approximation through
Monte Carlo counterfactual regret minimization.” In: AAMAS. Citeseer. 2012,
pp. 837–846.
[16] Daphne Koller and Nimrod Megiddo. “The complexity of two-person zerosum games in extensive form”. In: Games and Economic Behavior 4.4 (1992),
pp. 528–552. issn: 0899-8256. doi: https : / / doi . org / 10 . 1016 / 0899 -
8256(92 ) 90035 - Q. url: https : / / www . sciencedirect . com / science /
article/pii/089982569290035Q.
[17] Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel. “Efficient Computation of Equilibria for Extensive Two-Person Games”. In: Games and Economic Behavior 14.2 (1996), pp. 247–259. issn: 0899-8256. doi: https: / /
Redirecting. url: https://www.sciencedirect.
com/science/article/pii/S0899825696900512.
[18] Helmut Kuhn. “9. A SIMPLIFIED TWO-PERSON POKER”. In: 1951.
[19] Marc Lanctot et al. “Monte Carlo sampling for regret minimization in extensive
games”. In: Advances in neural information processing systems 22 (2009).
[20] Viliam Lisý and Michael H. Bowling. “Eqilibrium Approximation Quality of
Current No-Limit Poker Bots”. In: CoRR abs/1612.07547 (2016). arXiv: 1612.
07547. url: [1612.07547] Equilibrium Approximation Quality of Current No-Limit Poker Bots.
[21] Matej Moravcık et al. “DeepStack: Expert-Level Artificial Intelligence in NoLimit Poker”. In: CoRR abs/1701.01724 (2017). arXiv: 1701 . 01724. url:
[1701.01724] DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker.
[22] Todd W Neller and Marc Lanctot. “An introduction to counterfactual regret
minimization”. In: Proceedings of model AI assignments, the fourth symposium
on educational advances in artificial intelligence (EAAI-2013). Vol. 11. 2013.
[23] M.J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press.
MIT Press, 1994. isbn: 9780262650403. url: https://books.google.be/
books?id=5ntdaYX4LPkC.
[24] Jarkko Piiroinen. poker-hand-evaluator. https://github.com/jmp/pokerhand-evaluator. Accessed: 2022-04-15.
[25] Paul Senzee. Some Perfect Hash. Senzee 5 - Paul Senzee: June 2006
some-perfect-hash.html. Accessed: 2022-04-15.
[26] Finnegan Southey et al. “Bayes’ bluff: Opponent modelling in poker”. In: arXiv
preprint arXiv:1207.1411 (2012).
[27] Kevin Suffecool. Cactus Kev’s Poker Hand Evaluator. http://suffe.cool/
poker/evaluator.html. Accessed: 2022-04-15.
[28] Oskari Tammelin et al. “Solving Heads-Up Limit Texas Hold’em”. In: IJCAI.
2015.
[29] PioSolver team. Announcing PioSOLVER. https://www.piosolver.com/
blogs/news/17546256-announcing-piosolver. Accessed: 2022-07-02.
[30] Luís Filipe Teófilo, Luis Paulo Reis, and Henrique Lopes Cardoso. “Computing card probabilities in Texas Hold’em”. In: 2013 8th Iberian Conference on
Information Systems and Technologies (CISTI) (2013), pp. 1–6.
[31] The Great Poker Hand Evaluator Roundup. https://www.codingthewheel.
com/archives/poker-hand-evaluator-roundup/. Accessed: 2022-07-02.
[32] Kevin Waugh. “A fast and optimal hand isomorphism algorithm”. In: Workshops at the Twenty-Seventh AAAI Conference on Artificial Intelligence. 2013.
[33] What is a Solver in Poker? How Solvers Work How to Think About Them.
https://upswingpoker.com/solvers/. Accessed: 2022-07-02.
[34] Martin Zinkevich et al. “Regret minimization in games with incomplete information”. In: Advances in neural information processing systems 20 (2007).