In losing position snake should choose the path with a the best
chance, not the longest child
|
// TODO In losing position snake should choose the path with a the best |
* @param root The current Root node
* @return the best AbstractNode
*/
@Override
protected AbstractNode lastChance(final AbstractNode root) {
// TODO In losing position snake should choose the path with a the best
// chance, not the longest child
AbstractNode ret = null;
float score = 0;
cb333ac65e76fb8ff589dadfe2e7f805b4edda53