source: branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Algorithms.MonteCarloTreeSearch/Base/TreeNode.cs @ 12050

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using HeuristicLab.Algorithms.Bandits;
using HeuristicLab.Problems.GrammaticalOptimization;

namespace HeuristicLab.Algorithms.MonteCarloTreeSearch
{
    public class TreeNode
    {
        public string phrase;
        public TreeNode parent;
        public List<TreeNode> children;
        public IBanditPolicyActionInfo actionInfo;
        public bool expandable;
        public List<int> unvisitedNonTerminals;

        public TreeNode(TreeNode parent, string phrase, bool expandable, List<int> unvisitedNonTerminals)
        {
            this.phrase = phrase;
            this.expandable = expandable;
            this.unvisitedNonTerminals = unvisitedNonTerminals;
        }
    }
}