The construction of computerchinesechessgame platform creates favorable conditions for the development of discrete event dynamic system theory and provides a good research platform for solving dynamic countermeasur...
详细信息
The construction of computerchinesechessgame platform creates favorable conditions for the development of discrete event dynamic system theory and provides a good research platform for solving dynamic countermeasure problems in discrete system. This paper analyses the existing problems of computerchinesechessgame, the structure and performance of computerchinesechessgame platform and the latest progress in the field of computerchinesechessgame. Additionally,it introduces the superior self-made teaching experience instruments with high practical value to combine education with recreation and improve university innovative research atmosphere.
In chinese-chesscomputergame (CCCG), a computer player could find the best move for a given board position by using alpha-beta search algorithm. The technique of iterative deepening is an enhancement to alpha-beta s...
详细信息
ISBN:
(纸本)9781424447053
In chinese-chesscomputergame (CCCG), a computer player could find the best move for a given board position by using alpha-beta search algorithm. The technique of iterative deepening is an enhancement to alpha-beta search. It is helpful to reduce the size of game tree. In this paper, we improved the prototypical one-ply iterative deepening (OPID) and proposed two-ply iterative deepening (TPID). In game tree searching, we extend the search by two plies from the previous iteration. An iterated series of 2-ply, 4-ply, 6-ply, (...) searches is carried out. In the experiments, we validate that TPID is feasible and effective. Through applying TPID to minimax search and alpha-beta search respectively, we found that the total number of nodes generated in TPID minimax search and TPID alpha-beta search are all reduced compared with OPID.
In chinese-chesscomputergame (CCCG), a computer player could find the best move for a given board position by using alpha-beta search algorithm. The technique of iterative deepening is an enhancement to alpha-beta s...
详细信息
In chinese-chesscomputergame (CCCG), a computer player could find the best move for a given board position by using alpha-beta search algorithm. The technique of iterative deepening is an enhancement to alpha-beta search. It is helpful to reduce the size of game tree. In this paper, we improved the prototypical one-ply iterative deepening (OPID) and proposed two-ply iterative deepening (TPID). In game tree searching, we extend the search by two plies from the previous iteration. An iterated series of 2-ply, 4-ply, 6-ply,…searches is carried out. In the experiments, we validate that TPID is feasible and effective. Through applying TPID to minimax search and alpha-beta search respectively, we found that the total number of nodes generated in TPID minimax search and TPID alpha-beta search are all reduced compared with OPID.
Aiming at search problem of chinese chess computer game, we present the iterative sort search techniques based on percentage evaluation and integrate percentage evaluation and iterative sort into problem of chinese ch...
详细信息
ISBN:
(纸本)9781424417339
Aiming at search problem of chinese chess computer game, we present the iterative sort search techniques based on percentage evaluation and integrate percentage evaluation and iterative sort into problem of chinese chess computer game. The technique could reflect weight of game sides on both chess force, search similarity on two neighbor ply, feature of high sensibility for the node sort on minimal window search by percentage evaluation on both chess force for game sides. On the basis of higher pruning efficiency, we solve lost of both optimal route and optimal solution problem for traditional searching problem and reach purpose of actual game. It has the actual application value in chinese chess computer game and game research on every other fields.
暂无评论