2010-09-01 03:01:43 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2010 BetaSteward_at_googlemail.com. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without modification, are
|
|
|
|
* permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
|
|
* conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
|
|
* of conditions and the following disclaimer in the documentation and/or other materials
|
|
|
|
* provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY BetaSteward_at_googlemail.com ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BetaSteward_at_googlemail.com OR
|
|
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* The views and conclusions contained in the software and documentation are those of the
|
|
|
|
* authors and should not be interpreted as representing official policies, either expressed
|
|
|
|
* or implied, of BetaSteward_at_googlemail.com.
|
|
|
|
*/
|
|
|
|
|
|
|
|
package mage.player.ai;
|
|
|
|
|
|
|
|
import mage.Constants.Outcome;
|
|
|
|
import mage.Constants.PhaseStep;
|
|
|
|
import mage.Constants.RangeOfInfluence;
|
|
|
|
import mage.abilities.Ability;
|
|
|
|
import mage.abilities.ActivatedAbility;
|
2011-02-19 04:22:31 +00:00
|
|
|
import mage.abilities.common.PassAbility;
|
2011-02-25 03:01:04 +00:00
|
|
|
import mage.abilities.costs.mana.GenericManaCost;
|
|
|
|
import mage.abilities.costs.mana.ManaCost;
|
|
|
|
import mage.abilities.costs.mana.ManaCosts;
|
|
|
|
import mage.abilities.costs.mana.VariableManaCost;
|
2010-09-01 03:01:43 +00:00
|
|
|
import mage.abilities.effects.Effect;
|
|
|
|
import mage.abilities.effects.SearchEffect;
|
|
|
|
import mage.cards.Cards;
|
|
|
|
import mage.choices.Choice;
|
|
|
|
import mage.game.Game;
|
|
|
|
import mage.game.combat.Combat;
|
|
|
|
import mage.game.combat.CombatGroup;
|
|
|
|
import mage.game.events.GameEvent;
|
2011-05-25 03:47:19 +00:00
|
|
|
import mage.game.permanent.Permanent;
|
2010-09-01 03:01:43 +00:00
|
|
|
import mage.game.stack.StackAbility;
|
|
|
|
import mage.game.stack.StackObject;
|
2012-06-12 06:38:39 +00:00
|
|
|
import mage.game.turn.*;
|
2010-09-01 03:01:43 +00:00
|
|
|
import mage.players.Player;
|
|
|
|
import mage.target.Target;
|
|
|
|
import mage.target.TargetCard;
|
2011-02-14 19:41:29 +00:00
|
|
|
import org.apache.log4j.Logger;
|
2010-09-01 03:01:43 +00:00
|
|
|
|
2012-06-12 06:38:39 +00:00
|
|
|
import java.util.*;
|
|
|
|
import java.util.concurrent.*;
|
|
|
|
|
2010-09-01 03:01:43 +00:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @author BetaSteward_at_googlemail.com
|
|
|
|
*/
|
|
|
|
public class ComputerPlayer2 extends ComputerPlayer<ComputerPlayer2> implements Player {
|
|
|
|
|
2011-02-14 19:41:29 +00:00
|
|
|
private static final transient Logger logger = Logger.getLogger(ComputerPlayer2.class);
|
2011-10-25 19:17:42 +00:00
|
|
|
private static final transient ExecutorService pool = Executors.newFixedThreadPool(1);
|
2010-09-01 03:01:43 +00:00
|
|
|
|
|
|
|
protected int maxDepth;
|
|
|
|
protected int maxNodes;
|
2011-05-08 03:16:00 +00:00
|
|
|
protected int maxThink;
|
2011-03-24 04:09:07 +00:00
|
|
|
protected int nodeCount = 0;
|
|
|
|
protected long thinkTime = 0;
|
2011-10-25 19:17:42 +00:00
|
|
|
protected transient LinkedList<Ability> actions = new LinkedList<Ability>();
|
|
|
|
protected transient List<UUID> targets = new ArrayList<UUID>();
|
|
|
|
protected transient List<String> choices = new ArrayList<String>();
|
|
|
|
protected transient Combat combat;
|
2010-09-01 03:01:43 +00:00
|
|
|
protected int currentScore;
|
2011-10-25 19:17:42 +00:00
|
|
|
protected transient SimulationNode root;
|
2010-09-01 03:01:43 +00:00
|
|
|
|
2011-05-08 03:16:00 +00:00
|
|
|
public ComputerPlayer2(String name, RangeOfInfluence range, int skill) {
|
2010-12-29 20:00:18 +00:00
|
|
|
super(name, range);
|
2011-05-08 03:16:00 +00:00
|
|
|
maxDepth = skill * 2;
|
|
|
|
maxThink = skill * 3;
|
2010-09-01 03:01:43 +00:00
|
|
|
maxNodes = Config.maxNodes;
|
|
|
|
}
|
|
|
|
|
|
|
|
public ComputerPlayer2(final ComputerPlayer2 player) {
|
|
|
|
super(player);
|
|
|
|
this.maxDepth = player.maxDepth;
|
|
|
|
this.currentScore = player.currentScore;
|
|
|
|
if (player.combat != null)
|
|
|
|
this.combat = player.combat.copy();
|
2011-11-03 01:39:03 +00:00
|
|
|
this.actions.addAll(player.actions);
|
|
|
|
this.targets.addAll(player.targets);
|
|
|
|
this.choices.addAll(player.choices);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public ComputerPlayer2 copy() {
|
|
|
|
return new ComputerPlayer2(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2012-01-11 02:29:53 +00:00
|
|
|
public boolean priority(Game game) {
|
2010-09-01 03:01:43 +00:00
|
|
|
logState(game);
|
2012-02-03 04:48:25 +00:00
|
|
|
game.getState().setPriorityPlayerId(playerId);
|
2010-09-01 03:01:43 +00:00
|
|
|
game.firePriorityEvent(playerId);
|
|
|
|
switch (game.getTurn().getStepType()) {
|
|
|
|
case UPKEEP:
|
|
|
|
case DRAW:
|
|
|
|
pass();
|
2012-01-11 02:29:53 +00:00
|
|
|
return false;
|
2010-09-01 03:01:43 +00:00
|
|
|
case PRECOMBAT_MAIN:
|
|
|
|
case BEGIN_COMBAT:
|
|
|
|
case DECLARE_ATTACKERS:
|
|
|
|
case DECLARE_BLOCKERS:
|
2011-10-09 18:27:38 +00:00
|
|
|
case FIRST_COMBAT_DAMAGE:
|
2010-09-01 03:01:43 +00:00
|
|
|
case COMBAT_DAMAGE:
|
|
|
|
case END_COMBAT:
|
|
|
|
case POSTCOMBAT_MAIN:
|
|
|
|
if (actions.size() == 0) {
|
|
|
|
calculateActions(game);
|
|
|
|
}
|
|
|
|
act(game);
|
2012-01-11 02:29:53 +00:00
|
|
|
return true;
|
2010-09-01 03:01:43 +00:00
|
|
|
case END_TURN:
|
|
|
|
case CLEANUP:
|
|
|
|
pass();
|
2012-01-11 02:29:53 +00:00
|
|
|
return false;
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
2012-01-11 02:29:53 +00:00
|
|
|
return false;
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
protected void act(Game game) {
|
|
|
|
if (actions == null || actions.size() == 0)
|
|
|
|
pass();
|
|
|
|
else {
|
|
|
|
boolean usedStack = false;
|
|
|
|
while (actions.peek() != null) {
|
|
|
|
Ability ability = actions.poll();
|
|
|
|
this.activateAbility((ActivatedAbility) ability, game);
|
2011-02-19 04:22:31 +00:00
|
|
|
if (logger.isDebugEnabled())
|
|
|
|
logger.debug("activating: " + ability);
|
2010-09-01 03:01:43 +00:00
|
|
|
if (ability.isUsesStack())
|
|
|
|
usedStack = true;
|
|
|
|
}
|
|
|
|
if (usedStack)
|
|
|
|
pass();
|
|
|
|
}
|
2011-04-29 02:52:52 +00:00
|
|
|
logger.info("Turn " + game.getTurnNum() + " Step " + game.getStep().toString() + " Player " + name + " Life " + life);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
protected void calculateActions(Game game) {
|
|
|
|
currentScore = GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
if (!getNextAction(game)) {
|
|
|
|
Game sim = createSimulation(game);
|
|
|
|
SimulationNode.resetCount();
|
2011-03-08 03:59:55 +00:00
|
|
|
root = new SimulationNode(null, sim, playerId);
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.debug("simulating actions");
|
2011-03-11 03:07:13 +00:00
|
|
|
if (!isTestMode)
|
2011-10-25 19:17:42 +00:00
|
|
|
addActionsTimed();
|
2011-03-11 03:07:13 +00:00
|
|
|
else
|
2011-10-25 19:17:42 +00:00
|
|
|
addActions(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
|
2011-03-24 04:09:07 +00:00
|
|
|
logger.info(name + " simulated " + nodeCount + " nodes in " + thinkTime/1000000000.0 + "s - average " + nodeCount/(thinkTime/1000000000.0) + " nodes/s");
|
2010-09-01 03:01:43 +00:00
|
|
|
if (root.children.size() > 0) {
|
|
|
|
root = root.children.get(0);
|
|
|
|
actions = new LinkedList<Ability>(root.abilities);
|
|
|
|
combat = root.combat;
|
2011-03-08 03:59:55 +00:00
|
|
|
if (logger.isDebugEnabled())
|
|
|
|
logger.debug("adding actions:" + actions);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
else
|
|
|
|
logger.debug("no actions added");
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
protected boolean getNextAction(Game game) {
|
|
|
|
if (root != null && root.children.size() > 0) {
|
|
|
|
SimulationNode test = root;
|
|
|
|
root = root.children.get(0);
|
|
|
|
while (root.children.size() > 0 && !root.playerId.equals(playerId)) {
|
|
|
|
test = root;
|
|
|
|
root = root.children.get(0);
|
|
|
|
}
|
2012-01-11 02:29:53 +00:00
|
|
|
logger.debug("simlating -- game value:" + game.getState().getValue(true) + " test value:" + test.gameValue);
|
|
|
|
if (root.playerId.equals(playerId) && root.abilities != null && game.getState().getValue(true).hashCode() == test.gameValue) {
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.debug("simulating -- continuing previous action chain");
|
2010-09-01 03:01:43 +00:00
|
|
|
actions = new LinkedList<Ability>(root.abilities);
|
|
|
|
combat = root.combat;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-10-25 19:17:42 +00:00
|
|
|
protected int minimaxAB(SimulationNode node, int alpha, int beta) {
|
2010-09-01 03:01:43 +00:00
|
|
|
UUID currentPlayerId = node.getGame().getPlayerList().get();
|
|
|
|
SimulationNode bestChild = null;
|
2011-02-26 05:16:04 +00:00
|
|
|
boolean isSimulatedPlayer = currentPlayerId.equals(playerId);
|
2010-09-01 03:01:43 +00:00
|
|
|
for (SimulationNode child: node.getChildren()) {
|
|
|
|
if (alpha >= beta) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "alpha beta pruning");
|
2010-09-01 03:01:43 +00:00
|
|
|
break;
|
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
// if (SimulationNode.nodeCount > maxNodes) {
|
|
|
|
// logger.debug(indent(node.depth) + "simulating -- reached end-state");
|
|
|
|
// break;
|
|
|
|
// }
|
2011-10-25 19:17:42 +00:00
|
|
|
int val = addActions(child, alpha, beta);
|
2011-02-26 05:16:04 +00:00
|
|
|
if (!isSimulatedPlayer) {
|
2010-09-01 03:01:43 +00:00
|
|
|
if (val < beta) {
|
|
|
|
beta = val;
|
|
|
|
bestChild = child;
|
2011-02-26 05:16:04 +00:00
|
|
|
node.setCombat(child.getCombat());
|
|
|
|
}
|
|
|
|
if (val == GameStateEvaluator.LOSE_SCORE) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- lose, can't do worse than this");
|
2011-02-26 05:16:04 +00:00
|
|
|
break;
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (val > alpha) {
|
|
|
|
alpha = val;
|
|
|
|
bestChild = child;
|
2011-02-26 05:16:04 +00:00
|
|
|
node.setCombat(child.getCombat());
|
|
|
|
}
|
|
|
|
if (val == GameStateEvaluator.WIN_SCORE) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- win, can't do better than this");
|
2011-02-26 05:16:04 +00:00
|
|
|
break;
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
node.children.clear();
|
|
|
|
if (bestChild != null)
|
|
|
|
node.children.add(bestChild);
|
2011-02-26 05:16:04 +00:00
|
|
|
if (!isSimulatedPlayer) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "returning minimax beta: " + beta);
|
2010-09-01 03:01:43 +00:00
|
|
|
return beta;
|
|
|
|
}
|
|
|
|
else {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "returning minimax alpha: " + alpha);
|
2010-09-01 03:01:43 +00:00
|
|
|
return alpha;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
protected SearchEffect getSearchEffect(StackAbility ability) {
|
|
|
|
for (Effect effect: ability.getEffects()) {
|
|
|
|
if (effect instanceof SearchEffect) {
|
|
|
|
return (SearchEffect) effect;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return null;
|
|
|
|
}
|
|
|
|
|
2011-03-08 03:59:55 +00:00
|
|
|
protected void resolve(SimulationNode node, Game game) {
|
2010-09-01 03:01:43 +00:00
|
|
|
StackObject ability = game.getStack().pop();
|
|
|
|
if (ability instanceof StackAbility) {
|
|
|
|
SearchEffect effect = getSearchEffect((StackAbility) ability);
|
|
|
|
if (effect != null && ability.getControllerId().equals(playerId)) {
|
|
|
|
Target target = effect.getTarget();
|
|
|
|
if (!target.doneChosing()) {
|
|
|
|
for (UUID targetId: target.possibleTargets(ability.getSourceId(), ability.getControllerId(), game)) {
|
|
|
|
Game sim = game.copy();
|
|
|
|
StackAbility newAbility = (StackAbility) ability.copy();
|
|
|
|
SearchEffect newEffect = getSearchEffect((StackAbility) newAbility);
|
|
|
|
newEffect.getTarget().addTarget(targetId, newAbility, sim);
|
|
|
|
sim.getStack().push(newAbility);
|
2011-03-08 03:59:55 +00:00
|
|
|
SimulationNode newNode = new SimulationNode(node, sim, ability.getControllerId());
|
2010-09-01 03:01:43 +00:00
|
|
|
node.children.add(newNode);
|
|
|
|
newNode.getTargets().add(targetId);
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating search -- node#: " + SimulationNode.getCount() + "for player: " + sim.getPlayer(ability.getControllerId()).getName());
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating resolve ");
|
2010-09-01 03:01:43 +00:00
|
|
|
ability.resolve(game);
|
|
|
|
game.applyEffects();
|
|
|
|
game.getPlayers().resetPassed();
|
|
|
|
game.getPlayerList().setCurrent(game.getActivePlayerId());
|
|
|
|
}
|
|
|
|
|
2011-10-25 19:17:42 +00:00
|
|
|
protected void addActionsTimed() {
|
2010-09-01 03:01:43 +00:00
|
|
|
FutureTask<Integer> task = new FutureTask<Integer>(new Callable<Integer>() {
|
2011-08-27 14:00:28 +00:00
|
|
|
@Override
|
2010-09-01 03:01:43 +00:00
|
|
|
public Integer call() throws Exception
|
|
|
|
{
|
2011-10-25 19:17:42 +00:00
|
|
|
return addActions(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
});
|
2011-03-24 04:09:07 +00:00
|
|
|
long startTime = System.nanoTime();
|
2010-09-01 03:01:43 +00:00
|
|
|
pool.execute(task);
|
|
|
|
try {
|
2011-05-08 03:16:00 +00:00
|
|
|
task.get(maxThink, TimeUnit.SECONDS);
|
2011-03-24 04:09:07 +00:00
|
|
|
long endTime = System.nanoTime();
|
|
|
|
long duration = endTime - startTime;
|
2011-08-27 14:00:28 +00:00
|
|
|
logger.info("Calculated " + SimulationNode.nodeCount + " nodes in " + duration/1000000000.0 + "s");
|
|
|
|
nodeCount += SimulationNode.nodeCount;
|
2011-03-24 04:09:07 +00:00
|
|
|
thinkTime += duration;
|
2010-09-01 03:01:43 +00:00
|
|
|
} catch (TimeoutException e) {
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.debug("simulating - timed out");
|
2010-09-01 03:01:43 +00:00
|
|
|
task.cancel(true);
|
2011-03-08 03:59:55 +00:00
|
|
|
// sleep for 1 second to allow cleanup to finish
|
|
|
|
try {
|
|
|
|
Thread.sleep(1000);
|
|
|
|
} catch (InterruptedException ex) {
|
|
|
|
logger.fatal("can't sleep");
|
|
|
|
}
|
2011-04-29 02:52:52 +00:00
|
|
|
long endTime = System.nanoTime();
|
|
|
|
long duration = endTime - startTime;
|
2011-08-27 14:00:28 +00:00
|
|
|
logger.info("Timeout - Calculated " + SimulationNode.nodeCount + " nodes in " + duration/1000000000.0 + "s");
|
|
|
|
nodeCount += SimulationNode.nodeCount;
|
2011-04-29 02:52:52 +00:00
|
|
|
thinkTime += duration;
|
2010-09-01 03:01:43 +00:00
|
|
|
} catch (ExecutionException e) {
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.fatal("Simulation error", e);
|
2011-02-13 13:22:35 +00:00
|
|
|
task.cancel(true);
|
2010-09-01 03:01:43 +00:00
|
|
|
} catch (InterruptedException e) {
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.fatal("Simulation interrupted", e);
|
2011-02-13 13:22:35 +00:00
|
|
|
task.cancel(true);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-10-25 19:17:42 +00:00
|
|
|
protected int addActions(SimulationNode node, int alpha, int beta) {
|
2010-09-01 03:01:43 +00:00
|
|
|
Game game = node.getGame();
|
|
|
|
if (Thread.interrupted()) {
|
|
|
|
Thread.currentThread().interrupt();
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "interrupted");
|
2010-09-01 03:01:43 +00:00
|
|
|
return GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
int val;
|
|
|
|
if (node.depth > maxDepth || game.isGameOver()) {
|
|
|
|
logger.debug(indent(node.depth) + "simulating -- reached end state");
|
2010-09-01 03:01:43 +00:00
|
|
|
val = GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
}
|
|
|
|
else if (node.getChildren().size() > 0) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- somthing added children:" + node.getChildren().size());
|
2011-10-25 19:17:42 +00:00
|
|
|
val = minimaxAB(node, alpha, beta);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
else {
|
2011-02-14 19:41:29 +00:00
|
|
|
if (logger.isDebugEnabled())
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- alpha: " + alpha + " beta: " + beta + " depth:" + node.depth + " step:" + game.getTurn().getStepType() + " for player:" + (node.getPlayerId().equals(playerId)?"yes":"no"));
|
2010-09-01 03:01:43 +00:00
|
|
|
if (allPassed(game)) {
|
|
|
|
if (!game.getStack().isEmpty()) {
|
2011-03-08 03:59:55 +00:00
|
|
|
resolve(node, game);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
// int testScore = GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
// if (testScore < currentScore) {
|
|
|
|
// // if score at end of step is worse than original score don't check any further
|
2011-02-14 19:41:29 +00:00
|
|
|
// logger.debug("simulating -- abandoning current check, no immediate benefit");
|
2010-09-01 03:01:43 +00:00
|
|
|
// return testScore;
|
|
|
|
// }
|
|
|
|
game.getPlayers().resetPassed();
|
|
|
|
playNext(game, game.getActivePlayerId(), node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (game.isGameOver()) {
|
|
|
|
val = GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
}
|
|
|
|
else if (node.getChildren().size() > 0) {
|
|
|
|
//declared attackers or blockers or triggered abilities
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- attack/block/trigger added children:" + node.getChildren().size());
|
2011-10-25 19:17:42 +00:00
|
|
|
val = minimaxAB(node, alpha, beta);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
else {
|
2011-10-25 19:17:42 +00:00
|
|
|
val = simulatePriority(node, game, alpha, beta);
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-14 19:41:29 +00:00
|
|
|
if (logger.isDebugEnabled())
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "returning -- score: " + val + " depth:" + node.depth + " step:" + game.getTurn().getStepType() + " for player:" + game.getPlayer(node.getPlayerId()).getName());
|
2010-09-01 03:01:43 +00:00
|
|
|
return val;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2011-10-25 19:17:42 +00:00
|
|
|
protected int simulatePriority(SimulationNode node, Game game, int alpha, int beta) {
|
2010-09-01 03:01:43 +00:00
|
|
|
if (Thread.interrupted()) {
|
|
|
|
Thread.currentThread().interrupt();
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "interrupted");
|
2010-09-01 03:01:43 +00:00
|
|
|
return GameStateEvaluator.evaluate(playerId, game);
|
|
|
|
}
|
2012-01-11 02:29:53 +00:00
|
|
|
node.setGameValue(game.getState().getValue(true).hashCode());
|
2010-09-01 03:01:43 +00:00
|
|
|
SimulatedPlayer currentPlayer = (SimulatedPlayer) game.getPlayer(game.getPlayerList().get());
|
2011-02-26 05:16:04 +00:00
|
|
|
boolean isSimulatedPlayer = currentPlayer.getId().equals(playerId);
|
2011-03-11 03:07:13 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating priority -- player " + currentPlayer.getName());
|
2010-09-01 03:01:43 +00:00
|
|
|
SimulationNode bestNode = null;
|
2011-10-25 19:17:42 +00:00
|
|
|
List<Ability> allActions = currentPlayer.simulatePriority(game);
|
2011-02-14 19:41:29 +00:00
|
|
|
if (logger.isDebugEnabled())
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- adding " + allActions.size() + " children:" + allActions);
|
2010-09-01 03:01:43 +00:00
|
|
|
for (Ability action: allActions) {
|
2011-03-05 02:54:45 +00:00
|
|
|
if (Thread.interrupted()) {
|
|
|
|
Thread.currentThread().interrupt();
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "interrupted");
|
2011-03-05 02:54:45 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
Game sim = game.copy();
|
2010-12-13 05:01:35 +00:00
|
|
|
if (sim.getPlayer(currentPlayer.getId()).activateAbility((ActivatedAbility) action.copy(), sim)) {
|
2010-09-01 03:01:43 +00:00
|
|
|
sim.applyEffects();
|
2011-03-08 03:59:55 +00:00
|
|
|
if (checkForUselessAction(sim, node, action, currentPlayer.getId())) {
|
|
|
|
logger.debug(indent(node.depth) + "found useless action: " + action);
|
2011-02-19 04:22:31 +00:00
|
|
|
continue;
|
2011-03-08 03:59:55 +00:00
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
if (!sim.isGameOver() && action.isUsesStack()) {
|
|
|
|
// only pass if the last action uses the stack
|
|
|
|
sim.getPlayer(currentPlayer.getId()).pass();
|
|
|
|
sim.getPlayerList().getNext();
|
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
SimulationNode newNode = new SimulationNode(node, sim, action, currentPlayer.getId());
|
2011-02-14 19:41:29 +00:00
|
|
|
if (logger.isDebugEnabled())
|
2011-03-11 03:07:13 +00:00
|
|
|
logger.debug(indent(newNode.depth) + "simulating -- node #:" + SimulationNode.getCount() + " actions:" + action);
|
2010-09-01 03:01:43 +00:00
|
|
|
sim.checkStateAndTriggered();
|
2011-10-25 19:17:42 +00:00
|
|
|
int val = addActions(newNode, alpha, beta);
|
2011-02-26 05:16:04 +00:00
|
|
|
if (!isSimulatedPlayer) {
|
2010-09-01 03:01:43 +00:00
|
|
|
if (val < beta) {
|
|
|
|
beta = val;
|
|
|
|
bestNode = newNode;
|
|
|
|
node.setCombat(newNode.getCombat());
|
|
|
|
}
|
2011-02-26 05:16:04 +00:00
|
|
|
if (val == GameStateEvaluator.LOSE_SCORE) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- lose, can't do worse than this");
|
2011-02-26 05:16:04 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (val > alpha) {
|
|
|
|
alpha = val;
|
|
|
|
bestNode = newNode;
|
|
|
|
node.setCombat(newNode.getCombat());
|
|
|
|
if (node.getTargets().size() > 0)
|
|
|
|
targets = node.getTargets();
|
|
|
|
if (node.getChoices().size() > 0)
|
|
|
|
choices = node.getChoices();
|
|
|
|
}
|
2011-02-26 05:16:04 +00:00
|
|
|
if (val == GameStateEvaluator.WIN_SCORE) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- win, can't do better than this");
|
2011-02-26 05:16:04 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
if (alpha >= beta) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "simulating -- pruning");
|
2010-09-01 03:01:43 +00:00
|
|
|
break;
|
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
// if (SimulationNode.nodeCount > maxNodes) {
|
|
|
|
// logger.debug(indent(node.depth) + "simulating -- reached end-state");
|
|
|
|
// break;
|
|
|
|
// }
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (bestNode != null) {
|
|
|
|
node.children.clear();
|
|
|
|
node.children.add(bestNode);
|
|
|
|
}
|
2011-02-26 05:16:04 +00:00
|
|
|
if (!isSimulatedPlayer) {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "returning priority beta: " + beta);
|
2010-09-01 03:01:43 +00:00
|
|
|
return beta;
|
|
|
|
}
|
|
|
|
else {
|
2011-03-08 03:59:55 +00:00
|
|
|
logger.debug(indent(node.depth) + "returning priority alpha: " + alpha);
|
2010-09-01 03:01:43 +00:00
|
|
|
return alpha;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
protected boolean allPassed(Game game) {
|
|
|
|
for (Player player: game.getPlayers().values()) {
|
|
|
|
if (!player.isPassed() && !player.hasLost() && !player.hasLeft())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public boolean choose(Outcome outcome, Choice choice, Game game) {
|
2011-08-27 14:00:28 +00:00
|
|
|
if (choices.isEmpty())
|
2010-09-01 03:01:43 +00:00
|
|
|
return super.choose(outcome, choice, game);
|
|
|
|
if (!choice.isChosen()) {
|
|
|
|
for (String achoice: choices) {
|
|
|
|
choice.setChoice(achoice);
|
|
|
|
if (choice.isChosen()) {
|
|
|
|
choices.clear();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2011-04-01 03:34:16 +00:00
|
|
|
public boolean chooseTarget(Outcome outcome, Cards cards, TargetCard target, Ability source, Game game) {
|
2011-08-27 14:00:28 +00:00
|
|
|
if (targets.isEmpty())
|
2011-04-01 03:34:16 +00:00
|
|
|
return super.chooseTarget(outcome, cards, target, source, game);
|
2010-09-01 03:01:43 +00:00
|
|
|
if (!target.doneChosing()) {
|
|
|
|
for (UUID targetId: targets) {
|
|
|
|
target.addTarget(targetId, source, game);
|
|
|
|
if (target.doneChosing()) {
|
|
|
|
targets.clear();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-11-23 05:08:45 +00:00
|
|
|
@Override
|
2011-04-01 03:34:16 +00:00
|
|
|
public boolean choose(Outcome outcome, Cards cards, TargetCard target, Game game) {
|
2011-08-27 14:00:28 +00:00
|
|
|
if (targets.isEmpty())
|
2011-04-01 03:34:16 +00:00
|
|
|
return super.choose(outcome, cards, target, game);
|
2010-11-23 05:08:45 +00:00
|
|
|
if (!target.doneChosing()) {
|
|
|
|
for (UUID targetId: targets) {
|
|
|
|
target.add(targetId, game);
|
|
|
|
if (target.doneChosing()) {
|
|
|
|
targets.clear();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-02-25 03:01:04 +00:00
|
|
|
@Override
|
|
|
|
public boolean playXMana(VariableManaCost cost, ManaCosts<ManaCost> costs, Game game) {
|
|
|
|
//SimulatedPlayer.simulateVariableCosts method adds a generic mana cost for each option
|
|
|
|
for (ManaCost manaCost: costs) {
|
|
|
|
if (manaCost instanceof GenericManaCost) {
|
|
|
|
cost.setPayment(manaCost.getPayment());
|
|
|
|
logger.debug("using X = " + cost.getPayment().count());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2012-06-12 06:38:39 +00:00
|
|
|
game.informPlayers(getName() + " payed " + cost.getPayment().count() + " for " + cost.getText());
|
2011-02-25 03:01:04 +00:00
|
|
|
cost.setPaid();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-09-01 03:01:43 +00:00
|
|
|
public void playNext(Game game, UUID activePlayerId, SimulationNode node) {
|
|
|
|
boolean skip = false;
|
|
|
|
while (true) {
|
|
|
|
Phase currentPhase = game.getPhase();
|
|
|
|
if (!skip)
|
|
|
|
currentPhase.getStep().endStep(game, activePlayerId);
|
|
|
|
game.applyEffects();
|
|
|
|
switch (currentPhase.getStep().getType()) {
|
|
|
|
case UNTAP:
|
|
|
|
game.getPhase().setStep(new UpkeepStep());
|
|
|
|
break;
|
|
|
|
case UPKEEP:
|
|
|
|
game.getPhase().setStep(new DrawStep());
|
|
|
|
break;
|
|
|
|
case DRAW:
|
|
|
|
game.getTurn().setPhase(new PreCombatMainPhase());
|
|
|
|
game.getPhase().setStep(new PreCombatMainStep());
|
|
|
|
break;
|
|
|
|
case PRECOMBAT_MAIN:
|
|
|
|
game.getTurn().setPhase(new CombatPhase());
|
|
|
|
game.getPhase().setStep(new BeginCombatStep());
|
|
|
|
break;
|
|
|
|
case BEGIN_COMBAT:
|
|
|
|
game.getPhase().setStep(new DeclareAttackersStep());
|
|
|
|
break;
|
|
|
|
case DECLARE_ATTACKERS:
|
|
|
|
game.getPhase().setStep(new DeclareBlockersStep());
|
|
|
|
break;
|
|
|
|
case DECLARE_BLOCKERS:
|
2011-10-09 18:27:38 +00:00
|
|
|
game.getPhase().setStep(new FirstCombatDamageStep());
|
2010-09-01 03:01:43 +00:00
|
|
|
break;
|
2011-10-09 18:27:38 +00:00
|
|
|
case FIRST_COMBAT_DAMAGE:
|
|
|
|
game.getPhase().setStep(new CombatDamageStep());
|
|
|
|
break;
|
2010-09-01 03:01:43 +00:00
|
|
|
case COMBAT_DAMAGE:
|
2011-10-09 18:27:38 +00:00
|
|
|
game.getPhase().setStep(new EndOfCombatStep());
|
2010-09-01 03:01:43 +00:00
|
|
|
break;
|
|
|
|
case END_COMBAT:
|
|
|
|
game.getTurn().setPhase(new PostCombatMainPhase());
|
|
|
|
game.getPhase().setStep(new PostCombatMainStep());
|
|
|
|
break;
|
|
|
|
case POSTCOMBAT_MAIN:
|
|
|
|
game.getTurn().setPhase(new EndPhase());
|
|
|
|
game.getPhase().setStep(new EndStep());
|
|
|
|
break;
|
|
|
|
case END_TURN:
|
|
|
|
game.getPhase().setStep(new CleanupStep());
|
|
|
|
break;
|
|
|
|
case CLEANUP:
|
|
|
|
game.getPhase().getStep().beginStep(game, activePlayerId);
|
|
|
|
if (!game.checkStateAndTriggered() && !game.isGameOver()) {
|
|
|
|
game.getState().setActivePlayerId(game.getState().getPlayerList(game.getActivePlayerId()).getNext());
|
|
|
|
game.getTurn().setPhase(new BeginningPhase());
|
|
|
|
game.getPhase().setStep(new UntapStep());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!game.getStep().skipStep(game, game.getActivePlayerId())) {
|
|
|
|
if (game.getTurn().getStepType() == PhaseStep.DECLARE_ATTACKERS) {
|
|
|
|
game.fireEvent(new GameEvent(GameEvent.EventType.DECLARE_ATTACKERS_STEP_PRE, null, null, activePlayerId));
|
|
|
|
if (!game.replaceEvent(GameEvent.getEvent(GameEvent.EventType.DECLARING_ATTACKERS, activePlayerId, activePlayerId))) {
|
|
|
|
for (Combat engagement: ((SimulatedPlayer)game.getPlayer(activePlayerId)).addAttackers(game)) {
|
|
|
|
Game sim = game.copy();
|
|
|
|
UUID defenderId = game.getOpponents(playerId).iterator().next();
|
|
|
|
for (CombatGroup group: engagement.getGroups()) {
|
|
|
|
for (UUID attackerId: group.getAttackers()) {
|
|
|
|
sim.getPlayer(activePlayerId).declareAttacker(attackerId, defenderId, sim);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
sim.fireEvent(GameEvent.getEvent(GameEvent.EventType.DECLARED_ATTACKERS, playerId, playerId));
|
2011-03-08 03:59:55 +00:00
|
|
|
SimulationNode newNode = new SimulationNode(node, sim, activePlayerId);
|
|
|
|
logger.debug(indent(node.depth) + "simulating -- node #:" + SimulationNode.getCount() + " declare attakers");
|
2010-09-01 03:01:43 +00:00
|
|
|
newNode.setCombat(sim.getCombat());
|
|
|
|
node.children.add(newNode);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (game.getTurn().getStepType() == PhaseStep.DECLARE_BLOCKERS) {
|
|
|
|
game.fireEvent(new GameEvent(GameEvent.EventType.DECLARE_BLOCKERS_STEP_PRE, null, null, activePlayerId));
|
|
|
|
if (!game.replaceEvent(GameEvent.getEvent(GameEvent.EventType.DECLARING_BLOCKERS, activePlayerId, activePlayerId))) {
|
|
|
|
for (UUID defenderId: game.getCombat().getDefenders()) {
|
|
|
|
//check if defender is being attacked
|
|
|
|
if (game.getCombat().isAttacked(defenderId, game)) {
|
|
|
|
for (Combat engagement: ((SimulatedPlayer)game.getPlayer(defenderId)).addBlockers(game)) {
|
|
|
|
Game sim = game.copy();
|
|
|
|
for (CombatGroup group: engagement.getGroups()) {
|
|
|
|
for (UUID blockerId: group.getBlockers()) {
|
|
|
|
group.addBlocker(blockerId, defenderId, sim);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
sim.fireEvent(GameEvent.getEvent(GameEvent.EventType.DECLARED_BLOCKERS, playerId, playerId));
|
2011-03-08 03:59:55 +00:00
|
|
|
SimulationNode newNode = new SimulationNode(node, sim, defenderId);
|
|
|
|
logger.debug(indent(node.depth) + "simulating -- node #:" + SimulationNode.getCount() + " declare blockers");
|
2010-09-01 03:01:43 +00:00
|
|
|
newNode.setCombat(sim.getCombat());
|
|
|
|
node.children.add(newNode);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
game.getStep().beginStep(game, activePlayerId);
|
|
|
|
}
|
|
|
|
if (game.getStep().getHasPriority())
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
skip = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
game.checkStateAndTriggered();
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public void selectAttackers(Game game) {
|
2011-02-27 21:30:14 +00:00
|
|
|
if (logger.isDebugEnabled() && (combat == null || combat.getGroups().isEmpty()))
|
2011-02-25 03:01:04 +00:00
|
|
|
logger.debug("not attacking");
|
2010-09-01 03:01:43 +00:00
|
|
|
if (combat != null) {
|
|
|
|
UUID opponentId = game.getCombat().getDefenders().iterator().next();
|
|
|
|
for (UUID attackerId: combat.getAttackers()) {
|
|
|
|
this.declareAttacker(attackerId, opponentId, game);
|
2011-08-25 01:42:06 +00:00
|
|
|
if (logger.isDebugEnabled()) {
|
|
|
|
Permanent p = game.getPermanent(attackerId);
|
|
|
|
if (p != null)
|
|
|
|
logger.debug("attacking with:" + p.getName());
|
|
|
|
}
|
2011-02-25 03:01:04 +00:00
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public void selectBlockers(Game game) {
|
2011-02-14 19:41:29 +00:00
|
|
|
logger.debug("selectBlockers");
|
2010-09-01 03:01:43 +00:00
|
|
|
if (combat != null && combat.getGroups().size() > 0) {
|
|
|
|
List<CombatGroup> groups = game.getCombat().getGroups();
|
2010-12-22 04:26:51 +00:00
|
|
|
for (int i = 0; i < groups.size(); i++) {
|
|
|
|
if (i < combat.getGroups().size()) {
|
|
|
|
for (UUID blockerId: combat.getGroups().get(i).getBlockers()) {
|
|
|
|
this.declareBlocker(blockerId, groups.get(i).getAttackers().get(0), game);
|
2011-05-25 03:47:19 +00:00
|
|
|
if (logger.isDebugEnabled()) {
|
|
|
|
Permanent blocker = game.getPermanent(blockerId);
|
|
|
|
if (blocker != null)
|
|
|
|
logger.debug("blocking with:" + blocker.getName());
|
|
|
|
}
|
2010-12-22 04:26:51 +00:00
|
|
|
}
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copies game and replaces all players in copy with simulated players
|
|
|
|
*
|
|
|
|
* @param game
|
|
|
|
* @return a new game object with simulated players
|
|
|
|
*/
|
|
|
|
protected Game createSimulation(Game game) {
|
|
|
|
Game sim = game.copy();
|
|
|
|
|
|
|
|
for (Player copyPlayer: sim.getState().getPlayers().values()) {
|
2011-11-03 01:39:03 +00:00
|
|
|
Player origPlayer = game.getState().getPlayers().get(copyPlayer.getId()).copy();
|
2011-05-08 03:16:00 +00:00
|
|
|
SimulatedPlayer newPlayer = new SimulatedPlayer(copyPlayer.getId(), copyPlayer.getId().equals(playerId), maxDepth);
|
2010-09-01 03:01:43 +00:00
|
|
|
newPlayer.restore(origPlayer);
|
|
|
|
sim.getState().getPlayers().put(copyPlayer.getId(), newPlayer);
|
|
|
|
}
|
2011-03-24 04:09:07 +00:00
|
|
|
sim.setSimulation(true);
|
2010-09-01 03:01:43 +00:00
|
|
|
return sim;
|
|
|
|
}
|
|
|
|
|
2011-03-08 03:59:55 +00:00
|
|
|
/**
|
|
|
|
* resolve current ability on the stack if there is one, then
|
|
|
|
* check if current game state is the same as the previous, if so then
|
|
|
|
* action has no effect and is not useful
|
|
|
|
*
|
|
|
|
* @param sim
|
|
|
|
* @param node
|
|
|
|
* @param action
|
|
|
|
* @param playerId
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
private boolean checkForUselessAction(Game sim, SimulationNode node, Ability action, UUID playerId) {
|
|
|
|
int currentVal = 0;
|
|
|
|
int prevVal = 0;
|
2011-02-19 04:22:31 +00:00
|
|
|
if (action instanceof PassAbility)
|
|
|
|
return false;
|
|
|
|
SimulationNode test = node.getParent();
|
2011-03-08 03:59:55 +00:00
|
|
|
if (test == null)
|
|
|
|
return false;
|
|
|
|
if (action.isUsesStack()) {
|
|
|
|
Game testSim = sim.copy();
|
|
|
|
StackObject ability = testSim.getStack().pop();
|
|
|
|
ability.resolve(testSim);
|
|
|
|
testSim.applyEffects();
|
|
|
|
currentVal = GameStateEvaluator.evaluate(playerId, testSim, true);
|
2011-02-19 04:22:31 +00:00
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
else {
|
|
|
|
currentVal = GameStateEvaluator.evaluate(playerId, sim, true);
|
2011-02-19 04:22:31 +00:00
|
|
|
}
|
2011-03-08 03:59:55 +00:00
|
|
|
prevVal = GameStateEvaluator.evaluate(playerId, test.getGame(), true);
|
|
|
|
return currentVal == prevVal;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected String indent(int num) {
|
|
|
|
char[] fill = new char[num];
|
|
|
|
Arrays.fill(fill, ' ');
|
|
|
|
return Integer.toString(num) + new String(fill);
|
2011-02-19 04:22:31 +00:00
|
|
|
}
|
|
|
|
|
2010-09-01 03:01:43 +00:00
|
|
|
}
|