Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding
Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding
233-239
Noble, J.
440f07ba-dbb8-4d66-b969-36cde4e3b764
2002
Noble, J.
440f07ba-dbb8-4d66-b969-36cde4e3b764
Noble, J.
(2002)
Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding.
Wani, M. A.
(ed.)
In Proceedings of the 2002 International Conference on Machine Learning and Applications (ICMLA’02).
CSREA Press.
.
Record type:
Conference or Workshop Item
(Paper)
More information
Published date: 2002
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 265253
URI: http://eprints.soton.ac.uk/id/eprint/265253
PURE UUID: 22f2c2ce-b35e-4749-971e-e0a40fde607e
Catalogue record
Date deposited: 03 Mar 2008 23:28
Last modified: 14 Mar 2024 08:05
Export record
Contributors
Author:
J. Noble
Editor:
M. A. Wani
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics