No self-introduction
Loading
Profile
Follow
codes (2)
Tictectoe Tic-Tac-chess alpha beta-pruning
5.0
Basic minMax algorithm to achieve the TIC-TAC-chess game by alphabeta pruning algorithm is optimized. Alpha-beta pruning process General search method is a two-person game, practice has proved that this method can effectively reduce the number of nodes are generated during the search to improve search efficiency. Developed IBM's "deep blue" chess-playing program, is a search algorithm, the program has defeated World Chess Champion Garry Kasparov. Game search techniques described above can be used to solve the mentioned problem of some two-person game. But these methods don't yet fully reflect people's chess all the reasoning processes that are actually used, nor does it involve chess problem of representation and the heuristic function. For example a good chess player, chess Express has a unique pattern, they tend to remember is an identifiable collection of patterns, rather than individual pieces are located. In addition to gaming, in a short period of hand-to-hand com
yxy_sisi 1 0
1
car racing
no vote
peed dreams is a fork of the famous open racing car simulator torcs. it mainly aims to implement exciting new features, cars, tracks and ai opponents to make a more enjoyable game for the player, while constantly improving visual and physics realism
yxy_sisi 1 0
1
No more~
Follows0
Fans0