krukah / robopoker

Play, learn, solve, and analyze No-Limit Texas Hold Em. Implementation follows from Monte Carlo counter-factual regret minimization over with hierarchical K-means imperfect recall abstractions.
MIT License
43 stars 4 forks source link

README for variables #27

Open mayanksingh2298 opened 22 hours ago

mayanksingh2298 commented 22 hours ago

Hey this looks like some amazing work.

I'm trying to go through this code with the help of chatgpt, because rust is not my strong unit, but I'm picking it up.

Would love to make some enhancements to this.

Can you help me with a simple readme on how to tune the parameters?

krukah commented 19 hours ago

great to hear, thanks for opening the issue!

krukah commented 19 hours ago

this is pretty much a passion project i've been working on the side for a few months, originally just to learn Rust but i've seen a lot of interest in the library from people who want to do their own research / build their own products which has been cool. but there's no official roadmap or anything at the moment -- my plan is to probably build some tools to analyze the street.abstraction and blueprint.profile lookup tables, and also build a simple BlueprintPlayer that you can play against in the CLI, before implementing the game-changing-pluribus-differentiating real-time search feature

krukah commented 19 hours ago

always welcoming + encouraging contributions though, so happy to brainstorm whatever enhancements you had in mind

mayanksingh2298 commented 11 hours ago

thanks again for your response. Maybe I can finally get in on rust while exploring this project.

Sound like a good motivation