@@ -2,9 +2,9 @@
 import game;
 
 class Solver_0
 {
-	this(const(Game) g) {}
+	this(in Game g) {}
 	char single_step() { return 'W'; }
 	void force(char c) {}
 }
 
@@ -13,9 +13,9 @@
 	int wait_count = 0;
 	int choke_count = 0;
 
 	Game g;
-	this(const(Game) g)
+	this(in Game g)
 	{
 		this.g = g.clone();
 		forbidden_cell = new bool[][](g.map.H+2, g.map.W+2);
 	}
@@ -23,15 +23,16 @@
 	char single_step()
 	{
 		Tuple!(string,int) de = death_move(g);
 		char c = act(g, de[0], de[1]);
-		g.command(c);
+		force(c);
 		return c;
 	}
 
 	void force(char c)
 	{
-		g.command(c);
+		if(c != 'A')
+			g.command(c);
 	}
 
 	Tuple!(string,int) death_move(const(Game) g)
 	{