After familiar with the basic operation and the conversion in the two chessboards, I tried to find someone to play in the charious chamber of the group, because the people's chess room for the number of people just registered (segment into 14 paragraphs, 5 Level player to the first-level master's highest level master) is zero, and if you have a high number and a number of people from zero, then if you win, you will not get points reward, but you lose The big points are great, so it is very good to find a good hand in the time, only the primary players can play.
Basically, the primary player chess road is simple to walk, and it is clearly belonging to the kind of chess method that is going to step. Using each step of using the 2 second CPU kernel level, all 10 5-minute limited time play games The computer wins and gets the title of Lianzhong Level 1 chess. Then I have a more advanced title, some more players join, I obviously feel that I don't want to be my heart, it is not a computer but I - the person who is operated, because the players relative to the primary player are relatively agile, Up to 72 steps within 5 minutes, the computer takes two seconds and time, and I often switch time in two chessboards, so that I am obviously unfavorable in the limited time. Because this has failed two discs, but according to the computer's chess method is absolutely excellent, one of the other party has the emperor and a car, and our emperor, one car, after (after the brave A soldier already in 2, the situation is obvious, but the other party adopts "delay" tactics, so that we will time out.
Next, I will adjust the time limit for each time to 10 minutes, but each step is also used for 2 seconds processor kernel time. After three events, in addition to the two operations mistakes, winning. The system is often a classic walking method, E4, F4, etc. Because the Lianzhong is generally a fast chess time limit, I have set the program as an offensive mode, and the offensive mode is conducive to the fast checkered time. Because the system can launder in a short time, the general people have obviously be weak A linear algorithm system, because the chess pieces involved in the residual system calculation are less than the midfielder, the depth can generally reach the level of 7/2 seconds.
After the 36th event, the system has obtained the title of Lianzhong 3-level chess (medium and high level). I tried to find some people who were relatively high. The reason for one of the failed is that the system's algorithm is incorrect. At that time, I used the 5 seconds core time, the emperor was at the A1, the opponent offensive A3, the system instructs the emperor to enter B1, the other party is chasing B3, our emperor Into the A1 avoids, the other party is like A2, and our car from A3 into A5 (I think the system makes the emperor to be blocked), but it is strange that when the other party repeated three attacks (like C2, after " When the general, the system chose a wrong way to avoid it in the A1 and B1 positions, and the position of our car allowed in the case where the A3 didn't have a guard, the emperor did not use it. Skating, causing 4 shifts to defeat. Why didn't the system not walking A3 to choose a wrong way? I am estimated that the system in the algorithm of the system is shifted in the emperor. In the past and the Casparov played the super system, it was very well solved, and there was no good solution to the problem. Talk about this issue while the battle.
