statistics/src/main/java/cz/xelfi/quoridor/statistics/OpeningTree.java
author Jaroslav Tulach <jaroslav.tulach@apidesign.org>
Tue, 14 Sep 2010 09:46:43 +0200
changeset 266 15fcdfc4cd4a
parent 264 d60370059c3c
permissions -rw-r--r--
Using maven-license-plugin and updating all missing headers
jaroslav@266
     1
/**
jaroslav@264
     2
 * Quoridor server and related libraries
jaroslav@264
     3
 * Copyright (C) 2009-2010 Martin Rexa
jaroslav@178
     4
 *
jaroslav@264
     5
 * This program is free software: you can redistribute it and/or modify
jaroslav@264
     6
 * it under the terms of the GNU General Public License as published by
jaroslav@264
     7
 * the Free Software Foundation, either version 3 of the License.
jaroslav@178
     8
 *
jaroslav@264
     9
 * This program is distributed in the hope that it will be useful,
jaroslav@264
    10
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
jaroslav@264
    11
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
jaroslav@264
    12
 * GNU General Public License for more details.
jaroslav@178
    13
 *
jaroslav@264
    14
 * You should have received a copy of the GNU General Public License
jaroslav@264
    15
 * along with this program. Look for COPYING file in the top folder.
jaroslav@264
    16
 * If not, see http://www.gnu.org/licenses/.
jaroslav@178
    17
 */
jaroslav@266
    18
jaroslav@178
    19
package cz.xelfi.quoridor.statistics;
jaroslav@178
    20
jaroslav@178
    21
import cz.xelfi.quoridor.Board;
jaroslav@178
    22
import cz.xelfi.quoridor.Move;
jaroslav@178
    23
import cz.xelfi.quoridor.webidor.Game;
jaroslav@178
    24
import cz.xelfi.quoridor.webidor.CommentedMove;
jaroslav@178
    25
import cz.xelfi.quoridor.IllegalPositionException;
jaroslav@178
    26
import java.util.Map;
jaroslav@178
    27
import java.util.HashMap;
jaroslav@178
    28
jaroslav@178
    29
/**
jaroslav@178
    30
 *
jaroslav@178
    31
 * @author Martin Rexa
jaroslav@178
    32
 */
jaroslav@178
    33
public class OpeningTree {
jaroslav@178
    34
    Map<String, OpeningTreeNode> nodes = new HashMap<String, OpeningTreeNode>();
jaroslav@178
    35
    OpeningTreeNode root;
jaroslav@178
    36
jaroslav@178
    37
    public OpeningTree(){
jaroslav@178
    38
        root = new OpeningTreeNode("ROOT");
jaroslav@178
    39
        nodes.put("ROOT", root);
jaroslav@178
    40
    }
jaroslav@178
    41
jaroslav@178
    42
    public OpeningTreeNode getRoot(){
jaroslav@178
    43
        return root;
jaroslav@178
    44
    }
jaroslav@178
    45
jaroslav@178
    46
    public OpeningTreeNode getNode(String hashCode){
jaroslav@178
    47
        return nodes.get(hashCode);
jaroslav@178
    48
    }
jaroslav@178
    49
jaroslav@178
    50
    public void processGame(Game game) throws IllegalPositionException{
jaroslav@178
    51
        OpeningTreeNode node = root;
jaroslav@178
    52
        OpeningTreeNode parentNode;
jaroslav@178
    53
        OpeningTreeNode mirrorNode = root;
jaroslav@178
    54
        OpeningTreeNode mirrorParentNode;
jaroslav@178
    55
        Board board = Board.empty();
jaroslav@178
    56
        Board mirrorBoard = Board.empty();
jaroslav@178
    57
        root.addGame(game);
jaroslav@178
    58
        for(CommentedMove move: game.getMoves()){
jaroslav@178
    59
            if(!move.getMove().equals(Move.RESIGN)){
jaroslav@178
    60
                parentNode = node;
jaroslav@178
    61
                mirrorParentNode = mirrorNode;
jaroslav@178
    62
                board = board.apply(move.getMove());
jaroslav@178
    63
                mirrorBoard = mirrorBoard.apply(move.getMove().getMirrorMove());
jaroslav@179
    64
                String hashCode = board.getCode();
jaroslav@179
    65
                String mirrorHashCode = mirrorBoard.getCode();
jaroslav@178
    66
                node = nodes.get(hashCode);
jaroslav@178
    67
                if(node == null){
jaroslav@178
    68
                    node = new OpeningTreeNode(hashCode);
jaroslav@178
    69
                    nodes.put(hashCode, node);
jaroslav@178
    70
                }
jaroslav@178
    71
                node.addGame(game);
jaroslav@178
    72
                mirrorNode = nodes.get(mirrorHashCode);
jaroslav@178
    73
                if(mirrorHashCode.equals(hashCode)){
jaroslav@178
    74
                    if(mirrorNode == null){
jaroslav@178
    75
                        mirrorNode = node;
jaroslav@178
    76
                    }
jaroslav@178
    77
                }else{
jaroslav@178
    78
                    if(mirrorNode == null){
jaroslav@178
    79
                        mirrorNode = new OpeningTreeNode(mirrorHashCode);
jaroslav@178
    80
                        nodes.put(mirrorHashCode, mirrorNode);
jaroslav@178
    81
                    }
jaroslav@178
    82
                    mirrorNode.addGame(game);
jaroslav@178
    83
                }
jaroslav@178
    84
                if(parentNode != null)
jaroslav@178
    85
                    parentNode.addChild(move.getMove(),node);
jaroslav@178
    86
                if(mirrorParentNode != null){
jaroslav@178
    87
                    if(parentNode.equals(mirrorParentNode) && node.equals(mirrorNode))
jaroslav@178
    88
                        ;
jaroslav@178
    89
                    else
jaroslav@178
    90
                        mirrorParentNode.addChild(move.getMove().getMirrorMove(),mirrorNode);
jaroslav@178
    91
                }
jaroslav@178
    92
            }
jaroslav@178
    93
        }
jaroslav@178
    94
        node.addFinishedGame(game);
jaroslav@178
    95
        if(!node.equals(mirrorNode))
jaroslav@178
    96
            mirrorNode.addFinishedGame(game);
jaroslav@178
    97
    }
jaroslav@178
    98
jaroslav@178
    99
}