In board games, game-logs record past game processes, which can be regarded as an accumulation of experience. Similar to a real person, a computer player can gradually increase its skill by learning from game-logs. Therefore, the game becomes more interesting. This paper proposes an extensible approach to mine experiential patterns from increasing game-logs. The computer player improves its strategies by utilizing these growing patterns, just as it acquires experience. To evaluate the effect and performance of the approach, we designed a sample board game as a test platform and elaborated an experiment consisting of a series of tests. Experimental results show that our approach is effective and efficient.

1. Introduction

Gaming is one of the main intellections in our daily life. To some extent, gaming shows the wisdom of humankind more directly. Artificial intelligence for games (Game AI) is an important subfield of AI research. The current generations of computer games offer an interesting testbed for Game AI [1]. Meanwhile, applying AI techniques to game design will make the games more interesting. The research of Game AI plays an important role in promoting the development of the computer game industry.

Board game is one of the earliest objects that AI focused on [2, 3]. By contrast with other types of games, board games reflect human’s intelligence more purely and thus attract the interest of AI researchers [4, 5]. At first, researchers concentrated on the algorithm design about the chess road searching and the chess manual matching and made some important progresses. John von Neumann presented the Minimax algorithm in 1920s [6]. Shannon [2] proposed the game tree searching algorithm with his chess program in 1950. Knuth and Moore deeply analyzed the alpha-beta pruning algorithm in 1958 [7]. Then, studies on AI in board games were widely launched [813]. Many contests of board games between machines and real persons showed the advances in AI research [1416]. Recently, researchers find that game-logs (game records) cover a lot of important and interesting knowledge. Chen et al. [17] proposed an approach to abstract expert knowledge from annotated Chinese chess game records. GO game records are used for the life and death predicting, the pattern acquisition, and the pattern matching [1820]. Esaki and Hashiyama [21] carried out some experiments to extract human players’ strategies from the game records of Shogi. Weber and Mateas [22] used a data mining approach to process game-logs for the strategy prediction. Takeuchi et al. [23] presented a way of evaluating game tree search methods by game records. Moreover, Wender [24] expounded how to use data mining and machine learning techniques to analyze the game-logs in his project.

The common design of board games is to factitiously set the difficulty level on an invincible computer player, but this way is just a simulation. However, human players often expect a computer player to act and think as a real person rather than a superman. Game-logs in a board game are considered as cumulative experience, which will become richer and more effective with the increase of game times. With the accumulation of the experience, computer players can gradually enhance their intelligence level, just like human beings. Data mining techniques can be used to extract experience from game-logs. Nevertheless, there are few works on this topic.

In this paper, an approach is presented to mine experiential patterns from the growing game-logs of a sample board game. The computer player can learn from these patterns to improve its intelligence naturally. Firstly, a Chinese checkers game was designed as a test platform for collecting game-logs and launching empirical studies. Then, series of algorithms based on a sequence-tree were proposed to mine experiential patterns from game-logs. These patterns included Experience Rules, Key States, and Checker Usage. Finally, the mined patterns were applied back to the test platform, and then a series of experimental tests was elaborated to verify the effectiveness and performance of our approach.

Experimental results demonstrate that our approach is effective and efficient and easy to be transplanted to fit for other types of games.

2. Methods

The application of the experiential pattern mining requires two basic conditions listed below.(i)The computer players of a game have the minimum ability to play the game correctly without any experiential pattern.Doing so ensures that the game can run properly in the initial stage.(ii)There are sufficient and valid game-logs to make the pattern mining task runnable.Only when the number of game-logs reaches a certain size can the regularity hidden in them appear. In addition, our purpose is to make computer players learn from human players’ strategies. So, these game-logs should be from human players’ games.

To satisfy the above conditions, we designed a simplified Chinese checkers game as a test platform to provide the basic move algorithms and collect the game-logs. Subsequent sections cover the following topics in detail:(a)the concepts concerned with the game and the mining algorithms;(b)the algorithms for mining experiential patterns;(c)the methods for applying experiential patterns to the game.

2.1. Key Concepts

The traditional Chinese checkers game has flexible gameplay (see [25] for more details). In this work, the game was simplified to be more convenient for experimenting (the design details are provided in Appendix). The key concepts used in the following sections are briefly explained below.

(i) Checker. The checker means the position used to put pieces on the chessboard. Each checker has its own coordinate.

(ii) Checkers-State. The checkers-state describes all the checkers on the chessboard and can be traversed to get or update the information of every checker.

(iii) Piece. Each player holds ten pieces. The coordinate of a piece is dependent on the current position of the piece.

(iv) Pieces-State. Pieces-states are used to store the coordinates of pieces. A pieces-state is a set that consists of several subsets. The number of the subsets depends on how many players are there in the game. Each subset contains ten elements, which correspond to the ten pieces of a player. For 2-player mode, there are two subsets, called the active side (SAS) and the passive side (SPS), respectively.

(v) Game-Log. During gaming, once a piece moves a step, the test platform will save the corresponding pieces-state to a game-log. The pieces-states in a game-log are sorted by their creation time. Hence, a game-log is a sequence of pieces-states. Separate XML files are used to store the game-logs.

(vi) Experiential Pattern. Experiential patterns are mined from game-logs and easily used by computer players. In this work, we considered three kinds of experiential patterns, including Experience Rule, Key State, and Checker Usage.

An Experience Rule is similar to an if-then rule. If pieces-state appears, then the player should achieve the pieces-state by moving a piece. The rule can be represented as , where is called last state and next state.

Key States are a group of particular pieces-states. They appear in victor games frequently and thus indicate some good game situation. By algorithm designing, one can help the computer player in approaching these Key States. Furthermore, approaching the Key States may also promote the applying of some Experience Rules, because some Key States may just be the last states or the next states.

Checker Usage describes the usage of a checker and is denoted by . The of a checker can be calculated by where represents the of checker ,   holds the times that has been used as the falling checker, and stores the number of game-logs in database.

2.2. Mining Experiential Patterns

By using some traditional move algorithms, the computer player may figure out the best move within several rounds. However, being subject to the computing capability of the computer and the requirement of game runtime, the computer player is hard to make more skillful moves or longer layouts. Humans improve their chess skill by accumulating the playing experience. A computer player can simulate this process to study experience from humans’ excellent games and thus make the moves more strategic. The three experiential patterns introduced in Section 2.1 are mined from the game-logs generated in the games of human-human mode. The data mining process is run in server-side, and its workflow is shown in Figure 1.

As shown in Figure 1, the data mining process consists of three phases, including data extraction, data mining, and data representation.

2.2.1. Data Extraction

Each game makes a single game-log file, and this will generate lots of XML files stored in server-side. These XML files are not suitable to be the direct data source of data mining. Therefore, the sequential data with consistent format needs to be extracted from game-logs and stored in database first.

Three data entities, PiecesState, PiecesStateSequence, and CheckerUsage, are used to format the game-logs. Their attributes are, respectively, shown in Tables 1, 2, and 3. The pieces-states in PiecesState are distinct, and each of them has a unique ID. The sequences in PiecesStateSequence are repeatable, and each of them corresponds to a game-log. The tuples in CheckerUsage have the same number as the checkers on the chessboard.

Algorithm 1 describes the process of data extraction.

Procedure  DataExtraction
 statesD, the data table of PiecesState in database.
 files: the XML files of game-logs.
Output: Non.
(01) let  stateIds be the set of PiecesState ids;
(02) let  file be a file of game-log;
(03) let  statesF be the set of the pieces-states extracted from game-logs;
(04) let  newStateId be the new PiecesState id;
(05) while  files.empty == false  do
(06) file = files.getOne(); //Read a game-log.
(07) Extract the pieces-states from file, and save them to statesF;
(08) Extract the game result from file, and save it to result;
(09) for   = 0 to  statesF.length − 1 do
(10)  //Get the sequence of ids of PiecesState.
(11)  ifFound = false;
(12)  Update the times field of CheckerUsage with statesF[i].
(13)  for   = 0 to  statesD.length − 1 do
(14)   if  equal(statesF[i], statesD[j].state) then
(15)    stateIds.add(statesD[].id);
(16)    isFound = true;
(17)   count += result;
(18)   break;
(19)   endif
(20)  endfor
(21)  if  isFound == false  then
(22)   Insert statesF[i] into PiecesState;
(23)   count = result;
(24)   Save the new id to newStateId.
(25)   stateIds.add(newStateId);
(26)   statesD.add(newStateId, statesF[i]);
(27)  endif
(28) endfor
(29) if  result != 0 then
(30)   = 1;
(31)  if  result ==   then
(32)    = 0;
(33)  endif
(34)  for   = 0 to  stateIds.length − 1 do
(35)   stateIds[] *= (−1) (() % 2);
(36)  endfor
(37) endif
(38) sequenceString = stateIds[];
(39) for   = 0 to  stateIds.length − 1 do
(40)  sequenceString += (“:” + stateIds[]);
(41) endfor
(42) Insert sequenceString into PiecesStateSequence;
(43) delete(file); //Delete the current game-log.
(44) endwhile

In Algorithm 1, lines (29)–(37) add a win/loss mark to the nondraw game and use minus to mark the pieces-states created by the loss player. Lines (38)–(41) combine all the PiecesState IDs from the same game into a single sequential string.

2.2.2. Data Mining

Experiential pattern mining means finding useful patterns from a large number of sequences composed of pieces-states. The types of these patterns include but are not limited to those mentioned in Section 2.1. Mining the Experience Rules, which are the most important experiential patterns in this work, is an objective of sequential pattern mining. Sequential pattern mining is a topic of data mining concerned with finding statistically relevant patterns between data examples where the values are delivered in a sequence [26]. In this field, many efforts of mining sequential patterns have been devoted to developing efficient algorithms, such as GSP [27], SPADE [28], CloSpan [29], PrefixSpan [30], and MEMISP [31]. In recent years, researchers have paid more attention to the applied research of sequential pattern mining as discussed elsewhere [3236].

In this section, we describe the methods for mining the three kinds of experiential patterns explained in Section 2.1.

Experience Rule. Experience Rules describe the experience of the human players most directly. The problem of mining Experience Rules can be described as follows. Let be a set of items, where each item is a sequence of pieces-states. Given a minimum support threshold minSupport, the aim is to find out all the consecutive binary subsequences (CBSSs) whose frequency is not less than minSupport. Each CBSS consists of two pieces-states that are consecutive in the original sequence, and this can be regarded as a constraint in data mining. In this paper, an algorithm based on pattern-growth is proposed for mining CBSSs. This algorithm uses a sequence-tree (see Figure 2) as the data structure to load all the sequences in database. The sequence-tree is different from the FP-tree [37] of frequent pattern mining, and we do not have to scan database previously to obtain the supports of every pieces-state. Algorithm 2 describes the procedure of creating a sequence-tree.

Procedure   SequenceTreeCreation
Input: sequencesD, the data table of PiecesStateSequence in database.
Output: root, the root node of the sequence-tree.
() let  stateIds save the ids of PiecesState;
() root = new Node(value = 0, branches = null);
() for   = 0 to   sequencesD.length − 1 do
() stateIds = sequencesD[].sequenceStr.split(“:”);
() //Eliminate redundant pieces-state of stateIds.
() for = stateIds.length − 1 to 2 do
()  for =  − 2 to 0 by 2 do
()   if   stateIds[] ==stateIds[]then
()    stateIds.delete( + 1, );
()     = ;
()   endif
()  endfor
() endfor
() node = root;
() for   = 1 to   stateIds.length − 1 do
()  if   node.value == 0 then
()   node.value = ;
()  endif
()  isFound = false;
()  if   node.branches != null then
()   for = 0 to   node.branches.length − 1 do
()    if   node.branches[].next.value == then
()     node.branches[].weight += (stateIds[]/);
()     node = node.branches[].next;
()     isFound = true;
()     break;
()    endif
()   endfor
()  endif
()  if   isFound == false then
()   branch = new Branch(
()    weight = stateIds[]/,
()    next = new Node(value = , branches = null)
()   );
()   node.branches.add(branch);
()   node = node.branches[node.branches.length − 1].next;
()  endif
()  //Merge the nodes of same values.
()  BranchShifting(root, node);
() endfor
() endfor
() return   root;

In Figure 2, value stores the ID of the pieces-state, weight represents the support of the related CBSS, and next stores the linkage pointing to the next node.

On a certain player’s perspective, if two same pieces-states appear, the moves between the two pieces-states will become noneffective interference data. Eliminating these data will reduce the unnecessary data analyses and improve the reliability of mining results (see lines (05)–(13) in Algorithm 2).

Not all the frequent CBSSs are good, since some of them may be from losing games. The support count of a CBSS denoted by suppCount can be calculated by where posSuppCount is the support count of the CBSS generated in winning games and negSuppCount in losing games.

By means of the win/loss mark, the suppCount of each CBSS has been calculated during the process of creating the sequence-tree. Hence, the weight of each branch is equal to the suppCount of the relevant CBSS. Moreover, the same pairs of nodes are not allowed to appear on the same sequence-tree; otherwise the suppCount values will be incomputable (as illustrated in Figure 3). To solve this problem, the algorithm for shifting branches is designed (see Algorithm 3).

Procedure  BranchShifting
root, the root node of the sequence-tree.
node, the pointer that points to the current node.
 Updated node.
isShifted, the result of shifting.
(01) if  node.value == root.value then
(02) node = root;
(03) return true;
(04) else
(05) if  root.branches == null then
(06)  return false;
(07) else
(08)  for    to  root.branches.length − 1  do
(09)   if BranchShifting(root.branches[].next, node) == true then
(10)    return true;
(11)   endif
(12)  endfor
(13)  return false;
(14) endif
(15) endif

To obtain the frequent CBSSs, the following formula is given: where supp denotes the support of a CBSS and totalSeqs denotes the total number of the sequences in database. Given a minSupport, the frequent CBSSs are those whose supports are not less than minSupport. All the frequent CBSSs can be found out by traversing the sequence-tree only once, and the script to do so is shown in Algorithm 4.

Procedure  CBSSFinding
minSupport, the minimum support threshold.
root, the root node of the sequence-tree.
total: the total number of sequences.
sps, the set of the found CBSSs.
 Updated sps.
(01) let  supp be the support of a CBSS;
(02) let  sp be the instance of SequentialPattern;
(03) if  root.branches == null then
(04) return;
(05) endif
(06) for to  root.branches.length − 1do
(07) supp = root.branches[].weight/total;
(08) if  supp   minSupport  then
(09)  sp = new SequentialPattern();
(10)  sp.premise = root.value;
(11)   sp.result = root.branches[].next.value;
(12)  sp.support = supp;
(13)  sps.add(sp);
(14) endif
(15) CBSSFinding(minSupport, root.branches[].next, total, sps);
(16) endfor

In Algorithm 4, the structure of the object SequentialPattern is shown in Figure 4. The found CBSSs will serve as the data source for selecting Experience Rules.

Key State. Given a threshold percentage minFreq, Key States are those pieces-states of the frequencies not less than minFreq. The frequency (denoted by freq) of a pieces-state can be calculated by where stores the total number of sequences in database and count denotes the occurrence number of the pieces-state in the net winning games. The value of count is figured out during the process of data extraction (see lines (17) and (23) in Algorithm 1).

In respect of threshold selection, adjusting minFreq dynamically in accordance with the number of Experience Rules can make the Key States more efficient.

Checker Usage. This pattern can be calculated by formula (1), in which the is figured out during the process of data extraction (see line (12) in Algorithm 1).

2.2.3. Data Representation

In this phase, the main task is to make the mined experiential patterns recognizable to the computer player. The experiential pattern here mainly refers to Experience Rule. The following format is used to represent an Experience Rule:

According to the data structure of the Experience Rule, the process of data representation can be described as follows. Replace the IDs, which denote the last states or next states of Experience Rules, with the corresponding pieces-states, and then write these pieces-states to an XML file in server-side.

However, the mined patterns may not be all reliable. For example, given a minSupport, the obtained Experience Rules are as follows: That is, one last state has multiple next states. When pieces-state appears, it is clearly reliable to select the pieces-state , which is of the highest support. Hence, the reliability selection should be done before data presentation. Algorithm 5 shows this process.

minSupport, the minimum support threshold.
total: the total number of sequences.
sequencesD, the data table of PiecesStateSequence in database.
sps, the set of reliable Experience Rules.
(01) root = CreatSequenceTree(sequencesD);
(02)  CBSSFinding(minSupport, root, total, sps);
(03) for to  sps.length – 2 do
(04) for to  sps.length − 1 do
(05)  if  sps[].premise == sps[].premisethen
(06)   if  sps[].support < sps[].supportthen
(07)    sps.delete();
(08)    −−;
(09)    break;
(10)   else
(11)    sps.delete();
(12)    −−;
(13)   endif
(14)  endif
(15) endfor
(16) endfor

2.3. Applying Experiential Patterns

The way of applying experiential patterns depends on the specific gameplay. In this section, we give a computer player’s strategy as shown in Figure 5 and then explain how to apply the mined experiential patterns to the actual game.

In the course of the game, the computer player uses Experience Rules first. Algorithm 6 demonstrates the procedure of matching Experience Rules.

Procedure  ExperienceRuleMatching
PS, the current pieces-state.
ERs: the set of Experience Rules.
nextPS, the next pieces-state.
(01) for each  er  in  ERs  do
(02) if  PS == er.lastthen
(03)  nextPS = er.next;
(04)  break;
(05) else
(06)  nextPS = null;
(07) endif
(08) endfor

When there are no available Experience Rules, the computer player will automatically approximate a certain Key State. Doing so can promote the formation of some good game situation and may activate some Experience Rules. Obviously, the approached Key State is the nearest pieces-state after the current one. So, all of the Key States are sorted by their occurrence time. Let and be two different pieces-states. Their order is defined below.

Definition 1. Assume that . If and , then is behind , which can be expressed as .

The concept of dissimilarity (denoted by Diss) is used to represent the closeness between two pieces-states. The Diss between and is equal to the least moves from to . The less the value of Diss, the closer the two pieces-states. For calculating Diss, the following definitions are given.

Definition 2. Let be a piece and let be a set of pieces-states. If the coordinate of is included in , then belongs to , which can be expressed as .

Definition 3. Let and be two checkers, and their coordinates, respectively, and . Then, the minimal number of steps for a move from to is called move distance from to and denoted by , which can be calculated by where the function is defined as

Definition 4. Let and be two pieces, and their checkers, respectively, and two pieces-states, , and . Then, the minimal number of steps for a move from to is called the Distance in Active Side between and , which is denoted by . Similarly, one can define the Distance in Passive Side between and , which is denoted by .

Algorithm 7 demonstrates the calculation of the distance between two pieces.

Procedure  PiecesDistanceCalculation
 PS, the current pieces-state.
, piece .
, piece .
 Dab, the distance between and .
()let  CS be the checkers-state;
() let  vAllFC be a vector to store the falling checkers of every layer.
() //The maximum distance between and .
() Calculate the move distance MDab;
() if  MDab == 0 or  MDab == 1 or  MDab == 2 then
() //If MDab is less than 3, there is no less distance.
()  return  MDab;
() endif
() for = 0 to 9 do
() CS[PS⋅SAS[]⋅][PS⋅SAS[]⋅] = 1;
() CS[PS⋅SPS[]⋅][PS⋅SPS[]⋅] = −1;
() endfor
() FindVirtualFallingCheckers(0, CS, , , true, vAllFC, 0);
() isBreak = false; //Denotes the end of searching.
() Dab = MDab; //The distance in the worst case.
() for each allFC  in  vAllFC  do
() for each in  allFC do
()  if  allFC.index == (MDab −1) then
()   isBreak = true; break;
()  endif
()  if == and == then
()   Dab = allFC.index + 1; isBreak = true;
()   break;
()  endif
()  if  allFC.index == (MDab −2) then break; endif
()  FindVirtualFallingCheckers(0, CS, , , true, vAllFC, allFC.index + 1);
() endfor
() if  isBreak == true then break; endif
() endfor
() return  Dab;
() //Search the virtual falling checkers of specified checkers.
() Function FindVirtualFallingCheckers(, CS, , , isFirstStep, vAllFC, index)
() begin
() for = 3to−3 do
()  if == −  then continue; endif
()  if == 0 then continue; endif
()  Search the next jumping falling checker (, ) in direction of checker (, ).
()  if (, ) exists then
()   vAllFC[index].add(new Coordinate(, ));
()   FindVirtualFallingCheckers(3, CS, , , false, vAllFC, index);
()  else if the piece on (, ) is of own side then
()   FindVirtualFallingCheckers(3, CS, , , true, vAllFC, index + 1);
()  else
()   if  isFirstStep == true then
()     vAllFC[index].add(new Coordinate(, ));
()   endif
()  endif
() endfor
() end

Let and be two pieces-states. According to Definitions 24, the dissimilarity matrices between and are defined as follows: where DissMatrixAS is defined on the active side and DissMatrixPS on the passive side. Then, the Diss between two pieces can be calculated by where and satisfy the following conditions, respectively:

It follows that the calculation of the Diss between pieces is a typical assignment problem in linear programming. This problem can be solved by Hungarian algorithm as discussed by Edmonds [38].

When there are no Key States behind the current pieces-state or the Diss between the nearest Key State and the current pieces-state is more than a given threshold, the computer player will execute a tentative move algorithm named TentativeMove, which was designed based on the traditional alpha-beta pruning algorithm [7] (see Appendix for more details). Moreover, the pattern Checker Usage is one of the parameters of TentativeMove.

3. Results and Discussions

In order to evaluate the effect and performance of our proposed approach, we conducted an experiment on our designed test platform mentioned in Section 2. The experiment contains a series of tests. To maintain the objectivity of the experiment, we chose the same group of testers, who are ten experienced human players.

3.1. Test in Human-Computer Mode without any Experiential Patterns

Each tester played against the computer player for 30 games, serving as offensive player (OffP) and defensive player (DefP) alternately. The computer player was only allowed to use TentativeMove using a default value of Checker Usage as the parameter. A total of 300 game-logs in this test were recorded. The test results are shown in Table 4.

Furthermore, we observed the performance of our algorithms by using the parameter ATMC (the average time for each move of the computer player). A script embedded into the program was used to calculate the response time of the computer player during testing and give the value of ATMC in the end. In this test, the value of ATMC was 5.85 s (s = seconds).

Descriptions of Effects. (a) The computer player has the ability to play correctly; (b) the winning rate of the computer player in competition with every tester is not more than a half; (c) the computer player spends a little long time to move a piece.

Discussions. (a) Condition (i) mentioned at the beginning of Section 2 is satisfied by the TentativeMove algorithm; (b) the moves driven by TentativeMove may not be optimal due to the error of its evaluation function and the restraint of searching depth, which affects the winning rate of the computer player; (c) TentativeMove has a deeper recursion depth. As the game goes on, the checkers to be searched in each recursive layer will increase rapidly, which degrades the performance of TentativeMove.

3.2. Test in Human-Human Mode for Collecting Game-Logs

Each tester played with all the others for 30 games, serving as OffP and DefP alternately. A total of 1350 game-logs in this test were recorded. This satisfied condition (ii) mentioned at the beginning of Section 2. Subsequently, additional tests in human-computer mode were performed to select the appropriate minSupport and minFreq. These tests were similar to those in Section 3.1, and the results are shown in Table 5. Finally, the experiential pattern mining program was executed with the selected minSupport and minFreq. As a result, we gained 528 Experience Rules and 575 Key States, and the Checker Usage of every checker was updated in real time.

As shown in Table 5, when minSupport was 2% and minFreq was 1%, the crest value of Auep was reached, which meant the mined experiential patterns were better utilized.

3.3. Test in Human-Computer Mode with Experiential Patterns

The test plan here was the same as that in Section 3.1, except for the applying of the experiential patterns obtained in the test mentioned in Section 3.2. The results are shown in Table 6, and the comparison with the test results in Section 3.1 is illustrated in Figure 6. In this test, the value of ATMC was 0.93 s.

Descriptions of Effects. (a) Figure 6 shows that, by using experiential patterns, the computer player has increased its winning rates in most of the games at different degrees; (b) the average number of the rounds per game has increased; (c) the value of ATMC has declined dramatically.

Discussions. (a) The effectiveness of experiential patterns will become more obvious with the increase of game-logs, and this will give the human players an impression that the computer player is learning from the experience; (b) in a few games such as 02-OffP and 07-DefP shown in Figure 6, although the computer player’s winning rates are not increased, the average number of the rounds per game is greatly raised (see the lines with bold font shown in Table 6). The testers obviously feel the improvement of the computer player’s chess skill; (c) if the Experience Rules exist, the computer player will match and use them first. Compared with TentativeMove, the pattern matching algorithm is of linear complexity and consumes less time (see Algorithm 6).

3.4. Test in Computer-Computer Mode

In this test, we set two computer players. One could use the experiential patterns and the other could not. They took turns to serve as OffP and played with each other for 30 games. The results are shown in Table 7.

Description of the Effect. The computer player using experience patterns has a great advantage in winning rate and ATMC.

Discussion. Experiential patterns can help the computer player in making more strategic moves; still, we are aware of four losing games of CP1 (as shown in Table 7). This indicates that some of the experiential patterns may not be really good. However, the invalid patterns will die out with the growth of game-logs.

3.5. Comparative Analysis on the Algorithms of Pattern Mining

A sequence database consists of sequences of ordered elements, and these elements contain some unordered items. The common objectives of the previous works [2731] are to find the interesting relations between these items. In this work, however, the pattern mining algorithms aim at finding only the frequent CBSSs in the game-logs. This can be considered as a special case of the sequential pattern mining on a sequence database. For ease of comparison, we implemented the traditional algorithm PrefixSpan and added some restraints to make it fit for mining in our game-logs. These restraints were (a) setting length of each subsequence to 2 and (b) setting size of each element to 1. The comparative results are shown in Figure 7.

Here the minSupport was set to 2%, and the given data set contained 1,650 sequences (i.e., game-logs), 155,100 elements (i.e., pieces-states). Figure 7 indicates that our algorithms compared with PrefixSpan are more efficient.

3.6. Discussion on the Using of Game-Logs

Previous works [1724] mainly discuss the methods of extracting expert knowledge from game records. The extracted knowledge is commonly used to construct a game agent of high intelligence. Differently, our work aims at helping a computer player in learning from growing game-logs, acquiring human’s experience, and gradually becoming more skillful. It is a practical approach to make the game more fascinating. Furthermore, by satisfying the two conditions mentioned at the beginning of Section 2, any board game can utilize this approach after a minor adjustment. And this shows the extensibility of our approach.

4. Conclusions

In this paper, a novel approach is proposed to mine experiential patterns from the game-logs of board game. Those experiential patterns can be utilized to improve the intelligence of a computer player. This approach makes computer players learn from human’s experience progressively during gaming and become more experienced with the increase of game-logs. This will make the game more interesting. We conducted an experiment on our designed test platform of Chinese checkers game, and the results demonstrate that our approach is effective, efficient, and extensible.

Nevertheless, our approach still needs improvements from several aspects, such as the following:(i)designing algorithms to automatically adjust the parameters minSupport and minFreq;(ii)optimizing the related algorithms to improve their access performance for a huge sequence-tree;(iii)researching the fast matching problem in massive experiential patterns;(iv)developing the approach for online analysis of game-logs;(v)looking for more experiential patterns making games interesting.


(1) Rules and Data Structures. The rules and data structures used for programming are described as follows.(i)Only use the 2-player mode.(ii)Move rules: there are two move rules, shift and jump. The shift means moving a single piece one step in any direction to an adjacent empty checker. The jump here means single-piece-jump, which is the simplest and most usual rule. An example of single-piece-jump is shown in Figure 8.(iii)Checker: a computer can get the complete appearance of a game by scanning all the checkers on the chessboard. A checker has three properties including color, position, and status. The color stores a hexadecimal number to represent the color of the piece on the checker. The position stores the coordinate of the checker. The status uses the values of 1, −1, and 0 to describe who is on the checker.(iv)Chessboard: for the convenience of programming, the chessboard is designed to fit for 2-player mode. That means the other four useless star corners on traditional chessboard are cut out (as illustrated in Figure 9).We used a coordinate system to locate the positions on the chessboard. This coordinate system is unfixed and has an included angle of 60°. Players have their own frames of axes with the same form (as shown in Figure 10). This design has two advantages. First, the space of the coordinate system is utilized sufficiently. Secondly, the coordinate discrepancy between checkers is eliminated naturally.Unavoidably, the unfixed coordinate system causes a checker to have dual coordinates (as shown in Figure 11).To solve this problem, it is necessary to consider one of the two frames of axes as the reference, which is called normal frame of axes (NFoA). The other one called reverse frame of axes (RFoA) can be converted to the NFoA with In formula (A.1), and are the coordinates in NFoA and RFoA, respectively.(v)Row: the row means the vertical distance from current checker to the origin of the coordinate system (as illustrated in Figure 12). For checker , the following equation holds: (vi)FD: the FD represents the distance moved forward by a piece. It can be calculated by where rowFC is the row of the falling checker and rowSC is the row of the starting checker. For example, if a player moves a piece from (1, 3) to (5, 6) in one step, then the FD of this move is 7 (as illustrated in Figure 13). Note that the FD is negative when moving a piece backward.(vii)Checkers-state: the checkers-state is an integer two-dimensional array. The subscripts and values of the checkers-state represent the coordinates and statuses of the corresponding checkers, respectively.(viii)Piece: it is time consuming to scan all the 81 checkers at runtime. But on the contrary, there are only 20 pieces in a game. Scanning these pieces is efficient. The piece has the same properties as the checker.(ix)Pieces-state: a pieces-state is a special set consisting of two subsets; one is active side and the other is passive side. Each subset has ten elements representing the coordinates of pieces as illustrated in Figure 14. In active side, the coordinates belong to the pieces of the player whose last move has led to this pieces-state. These pieces are sorted by their row values in ascending order (sorted by -axis when they are in the same row). The situation in passive side is just the opposite.The pieces-state can be formally defined as follows: By using formula (A.1), a pieces-state in RFoA can be easily transposed to that in NFoA.(2) Gameplay. A set of computer programs is designed to control the gameplay and save the game-logs automatically. For different purposes, the game provides three play modes described as follows.(i)Human-human mode: this mode is mainly used to collect the experience from humans. All the players in this mode are real persons.(ii)Computer-computer mode: this mode is only used for carrying out experiments. All the players in this mode are controlled by the computer programs.(iii)Human-computer mode: in this mode, a human player is allowed to play against the computer player, and the game-logs are also collected. This mode is in charge of effect analysis.

Taking the human-human mode as an example, the gameplay is shown in Figure 15. And the other two play modes can be designed in a similar way.

In the gameplay, there are three problems to be solved.

Problem 1. It is to find out all the falling checkers related to the specified starting checker.

Problem 2. It is to determine the legality of a move.

Problem 3. It is to make the computer player have the ability to move spontaneously.

The solution to Problem 1 is described in Algorithm 8.

Procedure  FindFallingCheckers
 d, the direction that will be searched in.
 PS, the specified pieces-state.
, the -coordinate of starting checker.
, the -coordinate of starting checker.
 isFS, whether it is the first step.
 allFC: the array for collecting falling checkers.
Output: Updated allFC.
()  for = 3 to −3 do
() //Don’t search the repeated falling checker.
() if   ==   then continue; endif
() //Don’t search the direction 0.
() if   == 0 then continue; endif
() Search the next jumping falling checker (, ) in direction of checker (, ).
() if (, ) exists then
()  allFC.add(new Coordinate(, ));
()  FindFallingCheckers(3, PS, , , allFC, false);
() else
()  if  isFS == true then
()   allFC.add(new Coordinate(, ));
()  endif
() endif
()  endfor
()  return  allFC;

In Algorithm 8, denotes the searching direction. According to the game rules, a piece can be moved in six surrounding directions. So, the term searching direction is defined (as illustrated in Figure 16).

The features of searching direction are listed below.(i)There is no direction 0.(ii)The IDs of opposite directions can be changed to each other by picking minus.(iii)The checkers in a certain direction can be found by adjusting the coordinates. Table 8 shows the calculations in every direction.

According to the three features, all checkers can be traversed recursively.

The solution to Problem 2 is described in Algorithm 9.

Procedure  LegalityDetermination
PS, the initial pieces-state.
cSC: the coordinate of starting checker.
cFC: the coordinate of falling checker.
True means legal, and false not legal.
 Updated PS.
()  let  CS be the checkers-state;
()  for    to 9 do
()  //Initialize the checkers-state from pieces-state.
() CS[PS⋅SAS[]⋅][PS⋅SAS[]⋅] = 1;
() CS[PS⋅SPS[]⋅][PS⋅SPS[]⋅] = −1;
()  endfor
()  FindFallingCheckers(0, CS, cSC, cSC, allFC, true);
()  for  each  Coordinate in  allFC do
() if  cFC ==Coordinate then
()  Update PS with cSC and cFC;
()  return  true;
() endif
()  endfor
() return false;

To solve Problem 3, we provide an algorithm based on the traditional alpha-beta pruning method (see Algorithm 10).

Procedure  TentativeMove
steps, the steps will be searched.
PS: the initial pieces-state.
isFL: whether it is the first level of recursion.
maxEva: the maximum value of evaluation.
(01) let  allFC be the set of falling checkers’ coordinates;
(02) let  cSC be the coordinate of starting checker;
(03) let  cFC be the coordinate of falling checker;
(04) let  CS be the checkers-state;
(05) let the elements of CS be equal to 0;
(06) for to 9 do
(07) //Obtain the checkers-state from pieces-state.
(08) CS[PS⋅SAS[]⋅][PS⋅SAS[]⋅] = 1;
(09) CS[PS⋅SPS[]⋅][PS⋅SPS[]⋅] = −1;
(10) endfor
(11) maxEva = −Infinity;
(12) steps - -;
(13) for to 9 do
(14) //Evaluate all moves by Depth First Search.
(15) copyCS = clone(CS);
(16) FindFallingCheckers(0, copyCS, PS⋅SAS[]⋅, PS⋅SAS[]⋅, allFC, true);
(17) for each  FC  in  allFC  do
(18)  FD = (FC + FC) − (PS⋅SAS[]⋅ + PS⋅SAS[]⋅);
(19)  Calculate FC_Incre;
(20)  Query CU;
(21)  thisEva = (FD + FC_Incre) * (1 + CU);
(22)  if  steps > 0and  isFL ==true then
(23)   copyPS = clone(PS);
(24)   Update copyPS with PS⋅SAS[] and FC.
(25)   PiecesStateTransposition(copyPS);
(26)   thisEva = thisEvaTentativeMove(Steps, copyPS, false);
(27)  endif
(28)  if  thisEva > maxEva  then
(29)   maxEva = thisEva;
(30)   cSC = PS⋅SAS[];
(31)   cFC = FC;
(32)  endif
(33) endfor
(34) endfor
(35) if  isFL == true  then
(36) Update PS with cSC and cFC;
(37) else  if  steps > 0then
(38) copyPS = clone(PS);
(39) Update copyPS with PS⋅SAS[] and FC;
(40) PiecesStateTransposition(copyPS);
(41) maxEva = maxEva TentativeMove (Steps, copyPS, false);
(42) endif
(43) return  maxEva;

In Algorithm 10, the evaluation function is formally defined as follows: where CU denotes the Checker Usage of the falling checker and FC_Incre denotes the number of increased legal falling checkers arising out of a move. Negative FC_Incre means that the number of falling checkers has decreased. Then, a simple evaluation function is given below:

Formula (A.6) is based on the following reasons:the longer the forward distance, the better the move;the more the generated falling checkers, the better the move;the higher the Checker Usage of the falling checker, the better the move.

To reduce the error of the evaluation function and ensure its execution efficiency, an appropriate value of steps is given. During these steps, a computer player alternately enacts both sides’ players to move, and the evaluation values of every move are recorded. Then, the algorithm calculates the difference of the sum of evaluation values between its own side and the opponent’s and selects the move with the maximum difference. Through testing, we set steps to 11 and obtained effect preferably.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


This work is supported by the Scientific Research Foundation of Hebei Education Department (Grant no. Z2012147), the Natural Science Foundation of Hebei Province (Grant no. F2014201100), and the Soft Science Research Program of Hebei Province (Grant no. 14450318D).