There are 0 repository under cfr topic.
A Java 8+ Jar & Android APK Reverse Engineering Suite (Decompiler, Editor, Debugger & More)
Scalable Implementation of Deep CFR and Single Deep CFR
Scan for secrets, endpoints, and other sensitive data after decompiling and deobfuscating Android files. (.apk, .xapk, .dex, .jar, .class, .smali, .zip, .aar, .arsc, .aab, .jadx.kts).
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.
rs-poker is a rust library that includes all of the poker evaluation tools that you need from hand ranking and starting card enumeration to a full agent arena for self learning.
A Docker image with four popular Java decompilers in one place (CFR, Fernflower, Krakatau, and Procyon) :rocket::hammer:
Omaha Poker functionality+some features for PokerRL Reinforcement Learning card framwork
Counterfactual Regret Minimization for a simplified version of Texas Hold'em poker
德州扑克人工智能AI,德州AI源码,德州游戏,德州俱乐部,德州扑克源码,德州源码,德州遊戲,德州俱樂部,德州撲克源碼,德州源碼,unity3D德州,德州开源,德州俱乐部源码,德州金币大厅源码;飞机Telegram: @xuzongbin001;聊天软件Mchat:xuzongbin001
This repository is the accompanying code for the paper CFVFP. This paper presents a new algorithm for solving incomplete information games - CFVFP, which has better results than MCCFR in some games. The paper has been accepted by NeurIPS 2024.
Several agents that can play poker (using probability, monte carlo, etc.) and clustering to get the types of poker players.
德州AI,德州AI模型,德州AI辅助软件,非完美信息博弈论,强化学习,神经网络,德州扑克AI算法和训练大模型,有意者Telegram :@xuzongbin001
This GitHub repository shows data collection and analysis for “Regulatory Fragmentation” paper by Kalmenovitz, Lowry and Volkova, The Journal of Finance (Forthcoming)
java class反编译mcp server
Counterfactual Regret Minimization Game solution methods for Julia
To make a constant frame rate MP4 video into a variable frame rate.
xinco [eXtensibe INformation COre] is a powerful Web-Service based Information and Document Management System (DMS) for files, text, URLs and contacts, featuring ACLs, versioning, full text search, an FTP-like client (easy install, J2EE+MySQL/PostgreSQL)
Virginia Campaign Finance (CF) Reports
This project is a heads-up no-limit Texas Hold’em solver designed to compute GTO strategies. It leverages CFR with efficient abstractions, allowing scalable strategy computation and analysis. The solver supports range input, action abstraction, and real-time decision-making, making it suitable for both research and practical gameplay analysis
Counterfactual regret minimization and Q-Learning for Blackjack and Hearts
Fine-tuned NER models for banking and regulation texts, trained on eCFR Title 12 using manual and few-shot (GPT 3.5 v3) annotations.
🇺🇾 Uruguyan Truco External Sampling Monte Carlo CFR AI
A microservice for building, modeling, and serializing Hold'em game trees.
A Monte Carlo CFR solver for All-In or Fold poker, computing approximate Nash-equilibrium strategies efficiently
A GTO solver for Spin & Go poker variant
Python implementation of Corrected Fisher Randomization (CFR)
Codes from the 2013 paper "An Introduction to Counterfactual Regret Minimization" by Todd W. Neller and Marc Lanctot
A Python implementation of Counterfactual Regret Minimization (CFR).
Eschewing importance Sampling by Computing a History value function to Estimate Regret
Solving Imperfect Information Games: Multiplayer Poker AI