PrudentSniper = [Sniper](http://codegolf.stackexchange.com/a/65427/6828), but with two special-case behaviors. One is that if there are three bots left, and PrudentSniper is the smartest, it will vote for the middle bot instead of the least smart. This allows it to win a few more showdowns. The other behavior is that if the smartest bot is gunning for it (voted for it or the analogous bot last time) and the least smart isn't, it will vote for the smartest in self defense. package WeakestLink.Players; import WeakestLink.Game.Vote; import java.util.Collections; import java.util.Iterator; import java.util.Set; public class PrudentSniper extends Player { @Override public int vote(Set<Integer> currentOpponents) { int smrt = getSmartness(); //count number of players smarter/stupider than me, find max/min Iterator<Integer> opps = currentOpponents.iterator(); int cnt_smrt=0, cnt_stpd=0, opp_smrt, min_stpd=10, max_smrt=0; while(opps.hasNext()){ opp_smrt = opps.next().intValue(); if(opp_smrt > max_smrt) max_smrt = opp_smrt; if(opp_smrt < min_stpd) min_stpd = opp_smrt; if(opp_smrt > smrt){ cnt_smrt++; } else if(opp_smrt < smrt){ cnt_stpd++; } } //identify enemies Iterator<Vote> votes = getRecentVotes().iterator(); boolean[] voted_for_me = new boolean[9]; while(votes.hasNext()) { Vote opp_vote = votes.next(); voted_for_me[opp_vote.getVoter()] = (opp_vote.getVoted() == getSmartness() || (opp_vote.getVoted() < getSmartness() && cnt_stpd < 1) || (opp_vote.getVoted() > getSmartness() && cnt_smrt < 1)); } if (currentOpponents.size() < 3 || cnt_stpd < 2 || (voted_for_me[max_smrt] && !voted_for_me[min_stpd] && cnt_smrt > 0) ) return max_smrt; else return min_stpd; } }