Node.py

# -*- coding: UTF-8 -*-
import sys
import threading

class Node(object):

    value = 0
    board = None
    move = None
    parent = None
    children = []
    isRoot = False
    isLeaf = False

    def __init__(self, value=0, board=None, move=None, parent=None):
        self.value = value
        self.board = board
        self.move = move
        self.parent = parent

        if self.parent == None:
            self.isRoot = True

        self.isLeaf = True

    def addChildren(self, child):
        self.children.append(child)

    def addChildrenArray(self, childs):
        for child in childs:
            self.children.append(child)

    def __str__(self, level=0):
        ret = "\t" * level + repr(self.value) + "\n"
        for child in self.children:
            ret += child.__str__(level + 1)
        return ret

    def __repr__(self):
        return '<tree node representation>'


    def print_tree(self, current_node, indent="", last='updown'):

        nb_children = lambda node: sum(nb_children(child) for child in node.children) + 1
        size_branch = {child: nb_children(child) for child in current_node.children}

        """ Creation of balanced lists for "up" branch and "down" branch. """
        up = sorted(current_node.children, key=lambda node: nb_children(node))
        down = []
        while up and sum(size_branch[node] for node in down) < sum(size_branch[node] for node in up):
            down.append(up.pop())

        """ Printing of "up" branch. """
        for child in up:
            next_last = 'up' if up.index(child) is 0 else ''
            next_indent = '{0}{1}{2}'.format(indent, ' ' if 'up' in last else '│', " " * len(current_node.name))
            print_tree(child, indent=next_indent, last=next_last)

        """ Printing of current node. """
        if last == 'up':
            start_shape = '┌'
        elif last == 'down':
            start_shape = '└'
        elif last == 'updown':
            start_shape = ' '
        else:
            start_shape = '├'

        if up:
            end_shape = '┤'
        elif down:
            end_shape = '┐'
        else:
            end_shape = ''

        print
        '{0}{1}{2}{3}'.format(indent, start_shape, current_node.name, end_shape)

        """ Printing of "down" branch. """
        for child in down:
            next_last = 'down' if down.index(child) is len(down) - 1 else ''
            next_indent = '{0}{1}{2}'.format(indent, ' ' if 'down' in last else '│', " " * len(current_node.name))
            print_tree(child, indent=next_indent, last=next_last)