| 计算机桥牌双明手解的Hash表改进 |
| |
| 引用本文： | 程克非,张聪,沈一栋.计算机桥牌双明手解的Hash表改进[J].重庆大学学报(自然科学版),2005,28(12):45-47. |
| |
| 作者姓名： | 程克非 张聪 沈一栋 |
| |
| 作者单位： | 重庆邮电学院,计算机系,重庆,400065;重庆大学,计算机学院,重庆,400030;重庆交通学院,计算机系,重庆,400074;中国科学院,软件研究所计算机科学重点实验室,北京,100080 |
| |
| 摘 要： | 人工智能中关于牌类游戏的研究因为具有信息不完备的特点,在发展上落后于棋类游戏.牌类游戏研究的基础是在信息不完备条件下寻求一种快速的局面求解方法,虽然这个问题也非常困难.在采用Scout搜索的桥牌双明手算法基础上,提出根据牌局的特点对局面进行标准化编码的方案,从而提高了Scout搜索中Hash表的内存利用率和查询命中率,使得在剪枝过程中比原来的算法少展开5%的叶节点.
|
| 关 键 词： | 对策树搜索 Hash表 计算机桥牌 |
| 文章编号： | 1000-582X（2005）12-0045-03 |
| 收稿时间： | 2005-07-01 |
| 修稿时间： | 2005年7月1日 |
Improvement of Using Hash Table in Computer Bridge Double-dummy Solver |
| |
| CHENG Ke-fei,ZHANG Cong,SHEN Yi-dong.Improvement of Using Hash Table in Computer Bridge Double-dummy Solver[J].Journal of Chongqing University(Natural Science Edition),2005,28(12):45-47. |
| |
| Authors: | CHENG Ke-fei ZHANG Cong SHEN Yi-dong |
| |
| Institution: | 1. Computer Academy, Chongqing University of Posts and Communications, Chongqing 400065, China ; 2. College of Computer Science, Chongqing University, Chongqing 400030, China; 3. Computer Academy, Chongqing Jiaotong University, Chongqing 400074, China ; 4. Software Research Institute, Chinese Academy of Science, Beijing 100080, China |
| |
| Abstract: | Incomplete information of the poker games make the research progress lags behind the chess games in AI. Although it is still very difficult to find a fast algorithm to solve a poker game with complete information which is the foundation of some advance researches. This paper gives a standard way to encode and store a game state into hash table, so the memory of hash table can be used more effectively and higher hit rate can be gotten in Scout search meth od. With the new encoding method, the total expanding leaf nodes reduces by around 5%. |
| |
| Keywords: | game tree search hash table computer bridge |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
|
