/* * AttackWeakestThanMeStrategy.java * * Created on May 16, 2004, 12:22 AM */ package simulations.core.strategy.attackStrategy; import java.util.ArrayList; import java.util.Iterator; import simulations.core.Player; import simulations.core.history.Turn; /** * This class describes a strategy that attack all players that have less points than me * @author tom */ public class AttackWeakestThanMeStrategy extends AttackStrategy { /** Creates a new instance of AttackWeakestThanMeStrategy */ public AttackWeakestThanMeStrategy() { super(); name="AttackWeakestThanMeStrategy"; memoryParam=false; abr="9"; } /** return the description of this attack strategy * @return return the description of this attack strategy **/ public String getDescription() { if (negative) { return "attack : I attack all players\n"+ "that have less points than me\n"+ "COMPLEMENTARY"; } else { return "attack : I attack all players\n"+ "that have less points than me\n"; } } /** return the player to attack * @param player The attacking player * @param playerList The list of avalaible player * @return The player to attack */ public java.util.ArrayList getPlayerToAttack(simulations.core.Player player, java.util.ArrayList playerList) { ArrayList l = new ArrayList(); Iterator it = playerList.iterator(); while (it.hasNext()) { Player p = (Player)it.next(); if (p.getHitPoints()