Chessboard standard
Rule calculation logic path module
Independent computer operation program
Independent local human operation program
Independent network operation program
Voice reporting opponent's move
Voice reporting chess pieces on the chessboard in sequence
Chessboard magnifier
Input command and input battle program
A text has 90 characters, each originally a space character. At the start, some spaces are modified to specified characters, such as new game layout and end game, review.
Each chess game is recorded once when an operation is performed, and the chess game text is recorded.
Five arrays or storage units,
The first storage unit displays a relatively fixed chessboard and records changes in the chess game, and finally outputs the statistical result.
The second storage stores independent chess piece character information and movement interrelationships, as well as multi-piece combination relationships. Under the rich combination relationships, the opponent relationship develops (maybe multi-player melee with two or more people).
The third program learns and corrects errors. A cultural program that can recognize mistakes, correct them, and enhance non-chess communication with people. Primary, secondary, university, and life principles are considered good information, which can be rejected in communication. Or a chess opponent who learns from each other while chatting.
The fourth
The fifth later extension, changing the map, changing the chess pieces, changing the rules of other simulations, similar to grand strategy-like wargame推演, the energy gathering and dispersing of life journey
Character information definition, access and path, folder standard, logic loop?
Each chessboard position is a relatively independent information group. The chess piece information in it can be accessed, the chessboard part is read-only and cannot be accessed. All chessboard positions form a chessboard. There is an operation table outside the chessboard, which is the content of making moves and counting moves.
Dual computer program. When the human-machine host battles the computer, an auxiliary computer program colludes to fight the other computer. Maybe both of them will be defeated by the other side, but they can gain an advantage in non-competition by adding problematic characters to the opponent program, often making back moves but not agreeing to the computer's back moves, reducing the computer's thinking logic content, etc. non-positive combat methods (generally don't do this because it doesn't train chess skills).
A command group: Why. When asking the computer why, the computer displays the existing logic analysis.
Information bit information, chessboard position information, chess piece information, rule quantity increase and decrease information, chess piece increase and decrease quantity information on the chessboard.
The computer and the host perform a step logic comparison. There is a choice between this step and the next step. It is assumed that the choice is an infinite loop or a finite loop of 5 times, and then the first logic scheme is selected; the middle and both ends of the scheme are randomly selected once, the both ends of the scheme select the random selection of the head and tail once, and the order of one of the head and tail of the scheme is only randomly selected according to the first two; the time is from milliseconds to seconds to minutes to hours to days, months, years, step back from small to large to find the last digit of the system time number when the last key and command are intercepted, if the millisecond is zero, step back to seconds, if there is a non-zero, according to the single or double of the intercepted single or double, the parameters for random selection before and after, single is 1, double is 2, and the scheme has several choices that need several time interceptions. When there is only one scheme, the random selection program conditions are not met, and only the only scheme is selected. The computer records the current situation of both sides' chess pieces, analyzes and collects the possible movement and capture points of the next step, as well as the landing points of the possible movement and capture points' subsequent movement and capture, compares these combinations with each other internally, and finds some subsequent random selections that damage the opponent's chess pieces more and have less loss of their own chess pieces.
Periodic scan table, similar to a warehouse summary table of daily, weekly, monthly, quarterly, annual tables. When there are few, only scan the change difference for one piece in turn. When there are many pieces and the rules change, the synchronous moves can be scanned, summarized, compared, and analyzed for selection.
Only one step is recorded under the periodic rule. One step is performed according to the preset movement and capture rules of the chess pieces. The chess pieces are selected from several schemes except the first game, including subjective initiative, objective passivity, regular selection, and imitating irregular random. A total of three types of schemes with multiple staggered combinations form a selection thinking group.
Pause button under the human-machine chess game time limit round.
Free chess pieces and various bad plots such as rascals, thieves, robbers, bullies, bandits, autocratic, strong, and also active good plots are involved, as random personality and emotional content, mixed in the interaction of dialogues. The switch of this free choice is not certain, and the host can turn it on or off at any time. Chess pieces can go back, horses can move in non-day shapes, officials can go out of the palace, elephants can move like horses, cannons can hit the target after hitting multiple chess pieces, can run out of the chessboard, can be invisible, can be resurrected, can pretend that the chess program is wrong, etc.
Statistical of own side's environment ambiguity, statistical of own side itself, statistical of own side's core threat, opponent, comparison between own side and opponent. Statistical of own side, statistical of opponent, comparison selection of statistical between own side and opponent.
[ Last edited by zzz19760225 on 2017-8-1 at 21:30 ]
1<词>，2，3/段\，4{节}，5(章)。
