src/strategy/Parity3.java
private static TreeSet<Integer> p1reachesWR(Game game, TreeSet<Integer> subgame, TreeSet<Integer> winningregion) {
		Ranks.subgame(game, subgame, winningregion, 1);
		
		TreeSet<Integer> result = new TreeSet<Integer>();
		for (Integer key : subgame)
			if (game.states.get(key).rank > 0) // nonzero noninfinity
				result.add(key);
		return result;
	}
/**
	 * Computes the set of states where player 1 can reach the WR
	 * @param game				The entire game
	 * @param subgame			State space of the subgame
	 * @param winningregion		Player 1 wants to reach this
	 * @return					States where player 1 can reach the WR
	 */
Computes the set of states where player 1 can reach the WR
@param game                          The entire game
@param subgame                       State space of the subgame
@param winningregion         Player 1 wants to reach this
@return                                      States where player 1 can reach the WR
Computes the set of states where player 1 can reach the WR @param game The entire game @param subgame State space of the subgame @param winningregion Player 1 wants to reach this @return States where player 1 can reach the WR
private static TreeSet<Integer> p1reachesWR(Game game, TreeSet<Integer> subgame, TreeSet<Integer> winningregion) {
		Ranks.subgame(game, subgame, winningregion, 1);
		TreeSet<Integer> result = new TreeSet<Integer>();
		for (Integer key : subgame)
			if (game.states.get(key).rank > 0) 
				result.add(key);
		return result;
	}
private static TreeSet < Integer > p1reachesWR ( Game game , TreeSet < Integer > subgame , TreeSet < Integer > winningregion ) { Ranks . subgame ( game , subgame , winningregion , 1 ) ; TreeSet < Integer > result = new TreeSet < Integer > ( ) ; for ( Integer key : subgame ) if ( game . states . get ( key ) . rank > 0 ) result . add ( key ) ; return result ; }
Computes the set of states where player 1 can reach the WR
 @param game                          The entire game
 @param subgame                       State space of the subgame
 @param winningregion         Player 1 wants to reach this
 @return                                      States where player 1 can reach the WR
Computes the set of states where player 1 can reach the WR @param game The entire game @param subgame State space of the subgame @param winningregion Player 1 wants to reach this @return States where player 1 can reach the WR
// nonzero noninfinity