|
B
|
DecisionNode::traverseGameTree()
|
0
|
31
|
7
|
7
|
0
|
0
|
0
|
|
A
|
lucidtaz\minimax\engine\Engine::decide()
|
0
|
24
|
4
|
4
|
0
|
0
|
0
|
|
A
|
engine\DecisionNode::getChildResult()
|
0
|
12
|
2
|
2
|
0
|
0
|
0
|
|
A
|
engine\Evaluation::isBetterThan()
|
0
|
8
|
2
|
2
|
0
|
0
|
0
|
|
A
|
DecisionNode::makeLeafEvaluation()
|
0
|
7
|
1
|
1
|
0
|
0
|
0
|
|
A
|
minimax\engine\Analytics::forLeafNode()
|
8
|
8
|
1
|
1
|
0
|
0
|
0
|
|
A
|
engine\TraversalResult::__construct()
|
0
|
6
|
1
|
1
|
0
|
0
|
0
|
|
A
|
engine\Evaluation::getBestComparator()
|
0
|
6
|
2
|
2
|
0
|
0
|
0
|
|
A
|
engine\Analytics::forInternalNode()
|
8
|
8
|
1
|
1
|
0
|
0
|
0
|
|
A
|
engine\TraversalResult::create()
|
0
|
4
|
1
|
1
|
0
|
0
|
0
|
|
A
|
minimax\engine\AlphaBeta::__construct()
|
0
|
5
|
1
|
1
|
0
|
0
|
0
|
|
A
|
Evaluation::getWorstComparator()
|
0
|
6
|
2
|
2
|
0
|
0
|
0
|
|
A
|
engine\DecisionNode::isIdealOver()
|
0
|
8
|
2
|
2
|
0
|
0
|
0
|
|
A
|
lucidtaz\minimax\engine\Analytics::add()
|
0
|
6
|
1
|
1
|
0
|
0
|
0
|
|
A
|
engine\TraversalResult::withoutMove()
|
0
|
4
|
1
|
1
|
0
|
0
|
0
|
LucidTaZ /
minimax
