Dissertation > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer software > Program design,software engineering > Programming > Programming method

Gambling Algorithm on Chinese Chess’s Application

Author YuChao
Tutor RenLiZuo
School Ocean University of China
Course Computer technology
Keywords Artificial Intelligence Gambling Negamax algorithm Visual C++
CLC TP311.11
Type Master's thesis
Year 2011
Downloads 38
Quotes 0
Download Dissertation

The gambling technology is an artificial intelligence important application, I study the two person complete information class gambling question in this article. I also mainly introduce how to apply the maximum and minimum algorithm in the Chinese chess. And I develop a Chinese chess game program by Visual C++ in this article. The paper main research work includes:1. Has carried on the optimization the maximum and minimum algorithm, this article game program search engine based on the maximum and minimum algorithm optimized form is also negative maximum value algorithm.2. Has designed the algorithm estimate value module: The estimate value is one appraises an aspect fit and unfit quality through already some chess knowledge the process. Defines an estimate value module mainly to be composed of four parts: The board game piece battle efficiency appraisal, the board game piece nimble mobility appraisal, the board game piece reciprocity appraisal as well as coordinate four parts of compositions with the search engine.3. Has designed the algorithm search module: Myself design is the search module negative maximum value algorithm father node value is various subnodes value negative number negative maximum value, the estimate value function must to move a piece should who cares, if this red side returns just, walks regarding this black side aspect returns negative value. In algorithm principle, maximum and minimum algorithm completely equivalent in negative maximum value algorithm, negative maximum value algorithm is the maximum and minimum algorithm optimization formally, present’s game program mostly uses the cathode big form the searching algorithm. Negative maximum value algorithm structure is simple, the speed is quick, is advantageous realizes.4. Designed the move to have the module. The move has the module is completes based on a function named Cango(), this function is responsible in some kind of situation, produces each kind of board game piece’s move.5. Has manufactured the procedure operation contact surface module. I have established two dialog boxes class, joins the checkerboard and the board game piece resources to the project, completed with the aid of the Windows system bringing mouse response function has carried on the contact surface which the Chinese chess game needed.6. I design a Chinese chess Game Playing program based on negamax that is the negative form of minimax algorithm by Microsoft Visual C++ 6.0. There are four mainly modules in the Game Playing program, they are evaluation module, search module, walk maker module and operate interface module. After the four modules are compiled successfully by Visual C++, an exercisable file can be made. Running the exercisable file, we can play Chinese chess with our computer, and we can feel Game Playing technology in a simple program.

Related Dissertations
More Dissertations