earticle

논문검색

Computer Game System Modeling and Searching Algorithm for Occupancy of Niujiu Card

초록

영어

As a carrier of artificial intelligence research, computer game can establish a sound theoretical foundation for the research of non-zero-sum card games with imperfect information. In this paper, we first propose a game model based on the finite Moore automaton, which illustrates the implementation of the model for Niujiu card. At the same time, a novel search strategy combining IMP-minimax and Monte Carlo algorithm is presented in this model. Through the given algorithm, this paper accomplishes the simulation, including not only the process of minimal and optimal occupancy for the first player, but the available frequency of special card type. Experiments show that our model and algorithm are feasible and effective.

목차

Abstract
 1. Introduction
 2. Card Game Model
  2.1. Composition of Card Game Model
  2.2. Controller of Card Game Model
 3. Realization of Finite Automaton Based Card Game Model for Niujiu Card
  3.1. Formulas and Definition of Niujiu card
  3.2. Finite Automaton Based Recognition of Common Cards
  3.3. IMP-minimax and Monte Carlo based algorithm recognition of special card type
 6. Conclusions
 Acknowledgement
 References

저자정보

  • Chuanxi Zhang School of Information and technology in Beijing Forestry University, Beijing 100083, China
  • Dongmei Li School of Information and technology in Beijing Forestry University, Beijing 100083, China
  • Cong Dai School of Information and technology in Beijing Forestry University, Beijing 100083, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.