-
德州扑克牌值计算
POKER 计算值 斗地主 扎金花都离不开它
This article for the budding poker AI programmer provides a foundation for a simple implementation of No-Limit Texas Holdem Poker AI, covering the basics of hand strength evaluation and betting. By following the recipe set out here, you will quickly become able to implement a reasonably strong poker AI, and have a solid foundation on which to build. I assume you are familiar with the basic terminology of poker.
- 2022-08-15 11:28:52下载
- 积分：1
-
大规模数据集的自适应网格
Adaptive Grids for Clustering Massive Data Sets - MAFIA. It is a subspace clustering algorithm.-Adaptive Grids for Clustering Massive Data Sets- MAFIA. It is a subspace clustering algorithm.
- 2023-01-02 02:50:03下载
- 积分：1
-
交通仿真（排队论）小程序
This is the project of my course in the USA:
Customers
arrive at a service station (with a single server) according to the Poisson
process with a mean arrival rate of lambda = 0.3 (customers/min). Each customer
waits in queue (if present), proceeds to receive service upon his/her turn, and
departs the system when the service is completed. The service time is uniformly
distributed between 2.5 and 4.5 minutes. On each day, the service station is
open for two hours. Any customers in queue at the end of work hours are served
before closing the service station for the day. Use simulation (do 100
simulation runs) to determine
- 2023-02-02 14:55:04下载
- 积分：1
-
爬山 （人工智能）
这是人工智能的爬山算法。它给最短路径从源节点到目标节点。
- 2023-08-26 21:55:03下载
- 积分：1
-
crc校验算法，包括编码和解码
crc校验算法，包括编码和解码-unicef.org checksum algorithm, including encoding and decoding
- 2023-02-10 11:15:04下载
- 积分：1
-
n first primes in c
这个程序计算前n个素数。变量n由用户输入。
- 2022-07-02 17:38:25下载
- 积分：1
-
本程序采用fortran编写，为用Jacobi法求实对称矩阵的特征值与特征向量...
本程序采用fortran编写，为用Jacobi法求实对称矩阵的特征值与特征向量-This procedure using fortran prepared for the Jacobi method using realistic symmetric matrix eigenvalue and eigenvector
- 2022-03-02 17:08:55下载
- 积分：1
-
回溯法解N后的C++源码（Visual Stdio2010环境测试通过）
#include #include #include #include using namespace std;class Queen{ friend int nQueen(int);private: bool Place(int k); void Backtrack(int t); void Output(); int n,//皇后个数 *x;//当前解 long sum;//当前已找到的可行性方案数};bool Queen::Place(int k){ for (int j=1;jn) { sum++; Output(); } else { for (int i=1;i
- 2022-02-06 19:11:54下载
- 积分：1
-
背包问题
背包问题或背囊问题是组合优化中的一个问题： 鉴于一组项目，每个都有大量和一个值，确定每个项目中包含在集合中，这样，总重量是小于或等于给定的限制和总价值是尽可能大的编号。它把它的名字源于所面对的人的问题，受的限制，大小固定的背包，并必须填充的最有价值的项目。
此代码是背包问题的动态编程和递归函数。
- 2022-03-04 17:05:51下载
- 积分：1
-
BubbleSort_EM_C
Algoritmo de ordenação 单纯 chamado 冒泡排序，ou método bolha。Ordenação um comum e 单纯 de 矢量。É um porém eficiente 段的小家伙 vetores algoritmo ruim。
- 2022-09-17 14:55:04下载
- 积分：1
