6293256fec 2012-07-14        kinaba: import util;
6293256fec 2012-07-14        kinaba: import game;
6293256fec 2012-07-14        kinaba: 
9d4aca73fa 2012-07-14        kinaba: class Solver_0
9d4aca73fa 2012-07-14        kinaba: {
879099f815 2012-07-15        kinaba: 	this(in Game g) {}
9d4aca73fa 2012-07-14        kinaba: 	char single_step() { return 'W'; }
c2c105fda0 2012-07-15        kinaba: 	void force(char c) {}
9d4aca73fa 2012-07-14        kinaba: }
6293256fec 2012-07-14        kinaba: 
9d4aca73fa 2012-07-14        kinaba: class Solver_1
6293256fec 2012-07-14        kinaba: {
c743b817b7 2012-07-14        kinaba: 	int wait_count = 0;
ea96f24715 2012-07-14        kinaba: 	int choke_count = 0;
9d4aca73fa 2012-07-14        kinaba: 
9d4aca73fa 2012-07-14        kinaba: 	Game g;
879099f815 2012-07-15        kinaba: 	this(in Game g)
9d4aca73fa 2012-07-14        kinaba: 	{
9d4aca73fa 2012-07-14        kinaba: 		this.g = g.clone();
c4d04122d8 2012-07-14        kinaba: 		forbidden_cell = new bool[][](g.map.H+2, g.map.W+2);
9d4aca73fa 2012-07-14        kinaba: 	}
9d4aca73fa 2012-07-14        kinaba: 
9d4aca73fa 2012-07-14        kinaba: 	char single_step()
9d4aca73fa 2012-07-14        kinaba: 	{
c4d04122d8 2012-07-14        kinaba: 		Tuple!(string,int) de = death_move(g);
c4d04122d8 2012-07-14        kinaba: 		char c = act(g, de[0], de[1]);
879099f815 2012-07-15        kinaba: 		force(c);
9d4aca73fa 2012-07-14        kinaba: 		return c;
c2c105fda0 2012-07-15        kinaba: 	}
c2c105fda0 2012-07-15        kinaba: 
c2c105fda0 2012-07-15        kinaba: 	void force(char c)
c2c105fda0 2012-07-15        kinaba: 	{
879099f815 2012-07-15        kinaba: 		if(c != 'A')
879099f815 2012-07-15        kinaba: 			g.command(c);
c4d04122d8 2012-07-14        kinaba: 	}
c4d04122d8 2012-07-14        kinaba: 
c4d04122d8 2012-07-14        kinaba: 	Tuple!(string,int) death_move(const(Game) g)
b4aceba693 2012-07-14        kinaba: 	{
b4aceba693 2012-07-14        kinaba: 		string death;
c4d04122d8 2012-07-14        kinaba: 		int choice = 0;
b4aceba693 2012-07-14        kinaba: 		foreach(char c; "UDLRW") {
b4aceba693 2012-07-14        kinaba: 			Game gg = g.clone();
b4aceba693 2012-07-14        kinaba: 			gg.command(c);
b4aceba693 2012-07-14        kinaba: 			if( !gg.cleared && gg.dead )
b4aceba693 2012-07-14        kinaba: 				death ~= c;
c4d04122d8 2012-07-14        kinaba: 			else if( gg.map.robot != g.map.robot )
c4d04122d8 2012-07-14        kinaba: 				choice++;
2f2eff2f03 2012-07-14        kinaba: 			else if( c != 'W' ) // meaningless move
2f2eff2f03 2012-07-14        kinaba: 				death ~= c;
b4aceba693 2012-07-14        kinaba: 		}
c4d04122d8 2012-07-14        kinaba: 		return tuple(death, choice);
b4aceba693 2012-07-14        kinaba: 	}
b4aceba693 2012-07-14        kinaba: 
c4d04122d8 2012-07-14        kinaba: 	Tuple!(Pos, int)[] log;
c4d04122d8 2012-07-14        kinaba: 	bool[][] forbidden_cell;
c4d04122d8 2012-07-14        kinaba: 
c4d04122d8 2012-07-14        kinaba: 	char act(const(Game) g, string death, int breath)
9d4aca73fa 2012-07-14        kinaba: 	{
9d4aca73fa 2012-07-14        kinaba: 		const Pos   ro = g.map.robot;
9d4aca73fa 2012-07-14        kinaba: 		const Pos[] la = g.map.lambdas();
34bbd14c1a 2012-07-15        kinaba: 		const Pos[] ra = g.map.razors();
9d4aca73fa 2012-07-14        kinaba: 		const Pos   li = g.map.lift;
9f1a8c70cd 2012-07-15        kinaba: 		const Pos[] hi = g.map.objects('W');
9d4aca73fa 2012-07-14        kinaba: 
62a5c6c47f 2012-07-14        kinaba: 		Tuple!(char,int)[] cand;
9d4aca73fa 2012-07-14        kinaba: 		char c = 'W';
9d4aca73fa 2012-07-14        kinaba: 		if( la.empty ) {
901abf2f53 2012-07-14        kinaba: 			cand = search(g, ro, [li], death);
9d4aca73fa 2012-07-14        kinaba: 		} else {
34bbd14c1a 2012-07-15        kinaba: 			cand ~= search(g, ro, la~ra, death);
9f1a8c70cd 2012-07-15        kinaba: 		}
9f1a8c70cd 2012-07-15        kinaba: 
9f1a8c70cd 2012-07-15        kinaba: 		// 'higesori' mode
9f1a8c70cd 2012-07-15        kinaba: 		if( !hi.empty && g.map.razor>0 ) {
9f1a8c70cd 2012-07-15        kinaba: 			int his = 0;
9f1a8c70cd 2012-07-15        kinaba: 			for(int dy=-1; dy<=+1; ++dy)
9f1a8c70cd 2012-07-15        kinaba: 			for(int dx=-1; dx<=+1; ++dx)
9f1a8c70cd 2012-07-15        kinaba: 				if(g.map[ro.y+dy,ro.x+dx] == 'W')
9f1a8c70cd 2012-07-15        kinaba: 					his++;
9f1a8c70cd 2012-07-15        kinaba: 
9f1a8c70cd 2012-07-15        kinaba: 			if(his>=2 || his==hi.length)
9f1a8c70cd 2012-07-15        kinaba: 				cand = [tuple('S',int.max)];
9f1a8c70cd 2012-07-15        kinaba: 			if(cand.empty) {
9f1a8c70cd 2012-07-15        kinaba: 				const(Pos)[] tgt;
9f1a8c70cd 2012-07-15        kinaba: 				for(int y=1; y<=g.map.H; ++y)
9f1a8c70cd 2012-07-15        kinaba: 				for(int x=1; x<=g.map.W; ++x)
9f1a8c70cd 2012-07-15        kinaba: 					if(g.map[y,x]=='.'||g.map[y,x]==' ') {
9f1a8c70cd 2012-07-15        kinaba: 						his = 0;
9f1a8c70cd 2012-07-15        kinaba: 						for(int dy=-1; dy<=+1; ++dy)
9f1a8c70cd 2012-07-15        kinaba: 						for(int dx=-1; dx<=+1; ++dx)
9f1a8c70cd 2012-07-15        kinaba: 							if(g.map[y+dy,x+dx] == 'W')
9f1a8c70cd 2012-07-15        kinaba: 								his++;
9f1a8c70cd 2012-07-15        kinaba: 						if(his>=2)
9f1a8c70cd 2012-07-15        kinaba: 							tgt ~= new Pos(y,x);
9f1a8c70cd 2012-07-15        kinaba: 					}
9f1a8c70cd 2012-07-15        kinaba: 				cand ~= search(g, ro, tgt, death, true);
9f1a8c70cd 2012-07-15        kinaba: 			}
2f2eff2f03 2012-07-14        kinaba: 		}
2f2eff2f03 2012-07-14        kinaba: 
2f2eff2f03 2012-07-14        kinaba: 		// 'dig' mode
68c41bdbe0 2012-07-14        kinaba: 		if(cand.empty) {
68c41bdbe0 2012-07-14        kinaba: 			const(Pos)[] tgt;
68c41bdbe0 2012-07-14        kinaba: 			for(int y=1; y<=g.map.H; ++y)
68c41bdbe0 2012-07-14        kinaba: 			for(int x=1; x<=g.map.W; ++x)
68c41bdbe0 2012-07-14        kinaba: 				if(g.map[y,x]=='.')
68c41bdbe0 2012-07-14        kinaba: 					if(g.map[y+1,x]=='*'||g.map[y+1,x-1]=='*'||g.map[y+1,x+1]=='*'
68c41bdbe0 2012-07-14        kinaba: 					 ||g.map[y,x+1]=='*'||g.map[y,x-1]=='*')
68c41bdbe0 2012-07-14        kinaba: 						tgt ~= new Pos(y,x);
0c10424b3c 2012-07-14        kinaba: 			cand ~= search(g, ro, tgt, death, true);
c4d04122d8 2012-07-14        kinaba: 		}
68c41bdbe0 2012-07-14        kinaba: 
ea96f24715 2012-07-14        kinaba: 		if(cand.empty) {
ea96f24715 2012-07-14        kinaba: 			choke_count++;
68c41bdbe0 2012-07-14        kinaba: 			cand ~= tuple('W',int.max);
ea96f24715 2012-07-14        kinaba: 		}
62a5c6c47f 2012-07-14        kinaba: 		sort!((Tuple!(char,int) c1, Tuple!(char,int) c2){
62a5c6c47f 2012-07-14        kinaba: 			if(c1[1] != c2[1])
62a5c6c47f 2012-07-14        kinaba: 				return c1[1] < c2[1];
62a5c6c47f 2012-07-14        kinaba: 			return c1[0] < c2[0];
62a5c6c47f 2012-07-14        kinaba: 		})(cand);
62a5c6c47f 2012-07-14        kinaba: 		c = cand[0][0];
62a5c6c47f 2012-07-14        kinaba: 
2f2eff2f03 2012-07-14        kinaba: 		if(death.count(c) || wait_count>=2) {
2f2eff2f03 2012-07-14        kinaba: 			foreach(char live; "UDLRW")
c743b817b7 2012-07-14        kinaba: 				if(death.count(live)==0) {
c743b817b7 2012-07-14        kinaba: 					c=live;
c743b817b7 2012-07-14        kinaba: 					break;
c743b817b7 2012-07-14        kinaba: 				}
9d4aca73fa 2012-07-14        kinaba: 		}
c743b817b7 2012-07-14        kinaba: 
ea96f24715 2012-07-14        kinaba: 		if(c == 'W')
c743b817b7 2012-07-14        kinaba: 			wait_count++;
9d4aca73fa 2012-07-14        kinaba: 		else
c743b817b7 2012-07-14        kinaba: 			wait_count = 0;
ea96f24715 2012-07-14        kinaba: 		if(choke_count >= g.map.H)
ea96f24715 2012-07-14        kinaba: 			c = 'A';
c743b817b7 2012-07-14        kinaba: 
c4d04122d8 2012-07-14        kinaba: 		bool[char] choice;
c4d04122d8 2012-07-14        kinaba: 		foreach(t; cand)
c4d04122d8 2012-07-14        kinaba: 			choice[t[0]] = true;
c4d04122d8 2012-07-14        kinaba: 		log ~= tuple(ro.clone(), cast(int)choice.length);
c4d04122d8 2012-07-14        kinaba: 		if(log.length > 5)
c4d04122d8 2012-07-14        kinaba: 			log = log[$-5..$];
c4d04122d8 2012-07-14        kinaba: 		int cnt = 0;
c4d04122d8 2012-07-14        kinaba: 		foreach(l; log)
c4d04122d8 2012-07-14        kinaba: 			if(l[0] == log[$-1][0])
c4d04122d8 2012-07-14        kinaba: 				++cnt;
c4d04122d8 2012-07-14        kinaba: 		if( cnt >= 3 && breath==1 ) {
c4d04122d8 2012-07-14        kinaba: 			forbidden_cell[ro.y][ro.x] = true;
c4d04122d8 2012-07-14        kinaba: 		}
c4d04122d8 2012-07-14        kinaba: 
9d4aca73fa 2012-07-14        kinaba: 		return c;
6293256fec 2012-07-14        kinaba: 	}
9d4aca73fa 2012-07-14        kinaba: 
0c10424b3c 2012-07-14        kinaba: 	Tuple!(char,int)[] search(in Game g, in Pos s, in Pos[] gs, string death, bool danger_ok=false)
9d4aca73fa 2012-07-14        kinaba: 	{
62a5c6c47f 2012-07-14        kinaba: 		bool danger(int y, int x)
62a5c6c47f 2012-07-14        kinaba: 		{
0c10424b3c 2012-07-14        kinaba: 			if(g.map[y,x] == ' ' || g.map[y,x] == 'R')
0c10424b3c 2012-07-14        kinaba: 				return false;
62a5c6c47f 2012-07-14        kinaba: 			if(g.map[y+1,x] == '*')
62a5c6c47f 2012-07-14        kinaba: 				return true;
62a5c6c47f 2012-07-14        kinaba: 			if(g.map[y+1,x-1]=='*' && (g.map[y,x-1]=='\\'||g.map[y,x-1]=='*') && (g.map[y+1,x]==' '||g.map[y+1,x]=='R'))
62a5c6c47f 2012-07-14        kinaba: 				return true;
62a5c6c47f 2012-07-14        kinaba: 			if(g.map[y+1,x+1]=='*' && (g.map[y,x+1]=='*') && (g.map[y+1,x]==' '||g.map[y+1,x]=='R'))
62a5c6c47f 2012-07-14        kinaba: 				return true;
62a5c6c47f 2012-07-14        kinaba: 			if(g.map[y,x-1]=='*' && (g.map[y-1,x-1]=='\\'||g.map[y-1,x-1]=='*') && (g.map[y-1,x]==' '||g.map[y-1,x]=='R'))
62a5c6c47f 2012-07-14        kinaba: 				return true;
62a5c6c47f 2012-07-14        kinaba: 			if(g.map[y,x+1]=='*' && (g.map[y-1,x+1]=='*') && (g.map[y-1,x]==' '||g.map[y-1,x]=='R'))
62a5c6c47f 2012-07-14        kinaba: 				return true;
62a5c6c47f 2012-07-14        kinaba: 			return false;
62a5c6c47f 2012-07-14        kinaba: 		}
62a5c6c47f 2012-07-14        kinaba: 
5fc8a9c49b 2012-07-14        kinaba: 		// avoid directly below '*'
62a5c6c47f 2012-07-14        kinaba: 		Tuple!(char,int)[] tryA() {
901abf2f53 2012-07-14        kinaba: 			const(Pos)[] q;
901abf2f53 2012-07-14        kinaba: 			foreach(p; gs)
901abf2f53 2012-07-14        kinaba: 				if(!danger(p.y,p.x))
901abf2f53 2012-07-14        kinaba: 					q ~= p;
62a5c6c47f 2012-07-14        kinaba: 			bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
901abf2f53 2012-07-14        kinaba: 			foreach(p; q) v[p.y][p.x]=true;
901abf2f53 2012-07-14        kinaba: 			for(int step=1; q.length; ++step) {
901abf2f53 2012-07-14        kinaba: 				Pos[] q2;
901abf2f53 2012-07-14        kinaba: 				foreach(p; q) {
6e4c06b018 2012-07-14        kinaba: 					int[] yyy=[p.y-1,p.y+1,p.y,p.y];
6e4c06b018 2012-07-14        kinaba: 					int[] xxx=[p.x,p.x,p.x-1,p.x+1];
6e4c06b018 2012-07-14        kinaba: 					for(int i=0; i<yyy.length; ++i) {
6e4c06b018 2012-07-14        kinaba: 						int y = yyy[i];
6e4c06b018 2012-07-14        kinaba: 						int x = xxx[i];
6e4c06b018 2012-07-14        kinaba: 						if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
6e4c06b018 2012-07-14        kinaba: 							foreach(ppp; g.map.tr_source[g.map[y,x]]) {
6e4c06b018 2012-07-14        kinaba: 								yyy ~= ppp.y;
6e4c06b018 2012-07-14        kinaba: 								xxx ~= ppp.x;
6e4c06b018 2012-07-14        kinaba: 							}
6e4c06b018 2012-07-14        kinaba: 							continue;
6e4c06b018 2012-07-14        kinaba: 						}
901abf2f53 2012-07-14        kinaba: 						if(v[y][x]) continue;
6e4c06b018 2012-07-14        kinaba: 						if(y==s.y && x==s.x && i<4) {
901abf2f53 2012-07-14        kinaba: 							char c = "UDRL"[i];
901abf2f53 2012-07-14        kinaba: 							if( death.count(c) == 0 )
901abf2f53 2012-07-14        kinaba: 								return [tuple(c,step)];
901abf2f53 2012-07-14        kinaba: 						} else if(forbidden_cell[y][x]){
34bbd14c1a 2012-07-15        kinaba: 						} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||g.map[y,x]=='!'||i>=4) {
901abf2f53 2012-07-14        kinaba: 							if(danger(y,x))
901abf2f53 2012-07-14        kinaba: 								continue;
901abf2f53 2012-07-14        kinaba: 							q2 ~= new Pos(y,x);
901abf2f53 2012-07-14        kinaba: 							v[y][x]=true;
62a5c6c47f 2012-07-14        kinaba: 						}
5fc8a9c49b 2012-07-14        kinaba: 					}
5fc8a9c49b 2012-07-14        kinaba: 				}
901abf2f53 2012-07-14        kinaba: 				q = q2;
5fc8a9c49b 2012-07-14        kinaba: 			}
62a5c6c47f 2012-07-14        kinaba: 			return [];
5fc8a9c49b 2012-07-14        kinaba: 		}
5fc8a9c49b 2012-07-14        kinaba: 
5fc8a9c49b 2012-07-14        kinaba: 		// any empty space is my ground
62a5c6c47f 2012-07-14        kinaba: 		Tuple!(char,int)[] tryB() {
901abf2f53 2012-07-14        kinaba: 			const(Pos)[] q;
901abf2f53 2012-07-14        kinaba: 			foreach(p; gs) q ~= p;
62a5c6c47f 2012-07-14        kinaba: 			bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
901abf2f53 2012-07-14        kinaba: 			foreach(p; q) v[p.y][p.x]=true;
c4d04122d8 2012-07-14        kinaba: 			for(int step=10; q.length; ++step) {
62a5c6c47f 2012-07-14        kinaba: 				Pos[] q2;
62a5c6c47f 2012-07-14        kinaba: 				foreach(p; q) {
6e4c06b018 2012-07-14        kinaba: 					int[] yyy=[p.y-1,p.y+1,p.y,p.y];
6e4c06b018 2012-07-14        kinaba: 					int[] xxx=[p.x,p.x,p.x-1,p.x+1];
6e4c06b018 2012-07-14        kinaba: 					for(int i=0; i<yyy.length; ++i) {
6e4c06b018 2012-07-14        kinaba: 						int y = yyy[i];
6e4c06b018 2012-07-14        kinaba: 						int x = xxx[i];
6e4c06b018 2012-07-14        kinaba: 						if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
6e4c06b018 2012-07-14        kinaba: 							foreach(ppp; g.map.tr_source[g.map[y,x]]) {
6e4c06b018 2012-07-14        kinaba: 								yyy ~= ppp.y;
6e4c06b018 2012-07-14        kinaba: 								xxx ~= ppp.x;
6e4c06b018 2012-07-14        kinaba: 							}
6e4c06b018 2012-07-14        kinaba: 							continue;
6e4c06b018 2012-07-14        kinaba: 						}
62a5c6c47f 2012-07-14        kinaba: 						if(v[y][x]) continue;
6e4c06b018 2012-07-14        kinaba: 						if(y==s.y && x==s.x && i<4) {
62a5c6c47f 2012-07-14        kinaba: 							char c = "UDRL"[i];
62a5c6c47f 2012-07-14        kinaba: 							if( death.count(c) == 0 )
62a5c6c47f 2012-07-14        kinaba: 								return [tuple(c,step)];
c4d04122d8 2012-07-14        kinaba: 						} else if(forbidden_cell[y][x]){
34bbd14c1a 2012-07-15        kinaba: 						} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||g.map[y,x]=='!'||i>=4) {
62a5c6c47f 2012-07-14        kinaba: 							q2 ~= new Pos(y,x);
62a5c6c47f 2012-07-14        kinaba: 							v[y][x]=true;
62a5c6c47f 2012-07-14        kinaba: 						}
9d4aca73fa 2012-07-14        kinaba: 					}
9d4aca73fa 2012-07-14        kinaba: 				}
62a5c6c47f 2012-07-14        kinaba: 				q = q2;
9d4aca73fa 2012-07-14        kinaba: 			}
62a5c6c47f 2012-07-14        kinaba: 			return [];
9d4aca73fa 2012-07-14        kinaba: 		}
5fc8a9c49b 2012-07-14        kinaba: 
5fc8a9c49b 2012-07-14        kinaba: 		// push rocks!
62a5c6c47f 2012-07-14        kinaba: 		Tuple!(char,int)[] tryC() {
901abf2f53 2012-07-14        kinaba: 			const(Pos)[] q;
901abf2f53 2012-07-14        kinaba: 			foreach(p; gs) q ~= p;
62a5c6c47f 2012-07-14        kinaba: 			bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
901abf2f53 2012-07-14        kinaba: 			foreach(p; q) v[p.y][p.x]=true;
c4d04122d8 2012-07-14        kinaba: 			for(int step=20; q.length; ++step) {
62a5c6c47f 2012-07-14        kinaba: 				Pos[] q2;
62a5c6c47f 2012-07-14        kinaba: 				foreach(p; q) {
6e4c06b018 2012-07-14        kinaba: 					int[] yyy=[p.y-1,p.y+1,p.y,p.y];
6e4c06b018 2012-07-14        kinaba: 					int[] xxx=[p.x,p.x,p.x-1,p.x+1];
6e4c06b018 2012-07-14        kinaba: 					for(int i=0; i<yyy.length; ++i) {
6e4c06b018 2012-07-14        kinaba: 						int y = yyy[i];
6e4c06b018 2012-07-14        kinaba: 						int x = xxx[i];
faa7422a78 2012-07-14        kinaba: 						if(g.map[p] == '*') {
faa7422a78 2012-07-14        kinaba: 							if(i>=4)continue;
faa7422a78 2012-07-14        kinaba: 							if(y!=p.y)continue;
faa7422a78 2012-07-14        kinaba: 							if(g.map[y,p.x+(p.x-x)]!=' '&&g.map[y,p.x+(p.x-x)]!='R')continue;
faa7422a78 2012-07-14        kinaba: 						}
6e4c06b018 2012-07-14        kinaba: 						if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
6e4c06b018 2012-07-14        kinaba: 							foreach(ppp; g.map.tr_source[g.map[y,x]]) {
6e4c06b018 2012-07-14        kinaba: 								yyy ~= ppp.y;
6e4c06b018 2012-07-14        kinaba: 								xxx ~= ppp.x;
6e4c06b018 2012-07-14        kinaba: 							}
6e4c06b018 2012-07-14        kinaba: 							continue;
6e4c06b018 2012-07-14        kinaba: 						}
62a5c6c47f 2012-07-14        kinaba: 						if(v[y][x]) continue;
6e4c06b018 2012-07-14        kinaba: 						if(y==s.y && x==s.x && i<4) {
62a5c6c47f 2012-07-14        kinaba: 							char c = "UDRL"[i];
62a5c6c47f 2012-07-14        kinaba: 							if( death.count(c) == 0 )
62a5c6c47f 2012-07-14        kinaba: 								return [tuple(c,step)];
c4d04122d8 2012-07-14        kinaba: 						} else if(forbidden_cell[y][x]){
34bbd14c1a 2012-07-15        kinaba: 						} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||g.map[y,x]=='*'||g.map[y,x]=='!'||i>=4) {
62a5c6c47f 2012-07-14        kinaba: 							q2 ~= new Pos(y,x);
62a5c6c47f 2012-07-14        kinaba: 							v[y][x]=true;
62a5c6c47f 2012-07-14        kinaba: 						}
9d4aca73fa 2012-07-14        kinaba: 					}
6293256fec 2012-07-14        kinaba: 				}
62a5c6c47f 2012-07-14        kinaba: 				q = q2;
6293256fec 2012-07-14        kinaba: 			}
62a5c6c47f 2012-07-14        kinaba: 			return [];
62a5c6c47f 2012-07-14        kinaba: 		}
0c10424b3c 2012-07-14        kinaba: 		return (danger_ok ? [] : tryA()) ~ tryB() ~ tryC();
0c10424b3c 2012-07-14        kinaba: 	}
0c10424b3c 2012-07-14        kinaba: }
fec7ddc502 2012-07-14        kinaba: 
45b72fc54e 2012-07-15        kinaba: class Solver_2(Solver)
45b72fc54e 2012-07-15        kinaba: {
45b72fc54e 2012-07-15        kinaba: 	string plan;
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	Game g;
45b72fc54e 2012-07-15        kinaba: 	this(in Game g)
45b72fc54e 2012-07-15        kinaba: 	{
45b72fc54e 2012-07-15        kinaba: 		this.g = g.clone();
45b72fc54e 2012-07-15        kinaba: 		make_plan(g);
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	Tuple!(Solver,string) run_sub_solver(in Game g)
45b72fc54e 2012-07-15        kinaba: 	{
45b72fc54e 2012-07-15        kinaba: 		string log;
45b72fc54e 2012-07-15        kinaba: 		auto s = new Solver(g);
45b72fc54e 2012-07-15        kinaba: 		while(!g.cleared && !g.dead && plan.length<=g.map.H*g.map.W) {
45b72fc54e 2012-07-15        kinaba: 			char c = s.single_step();
45b72fc54e 2012-07-15        kinaba: 			if( c == 'A' )
45b72fc54e 2012-07-15        kinaba: 				break;
45b72fc54e 2012-07-15        kinaba: 			log ~= c;
45b72fc54e 2012-07-15        kinaba: 		}
45b72fc54e 2012-07-15        kinaba: 		while(log.length>0 && log[$-1]=='W')
45b72fc54e 2012-07-15        kinaba: 			log.length--;
45b72fc54e 2012-07-15        kinaba: 		return tuple(s, log);
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	void make_plan(in Game g) {
45b72fc54e 2012-07-15        kinaba: 		Tuple!(Solver,string) x = run_sub_solver(g);
45b72fc54e 2012-07-15        kinaba: 		plan = x[1];
45b72fc54e 2012-07-15        kinaba: 		if(x[0].g.cleared)
45b72fc54e 2012-07-15        kinaba: 			return;
45b72fc54e 2012-07-15        kinaba: 		modify_plan(g, x[0].g.score);
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	void modify_plan(in Game ini, long unmod)
45b72fc54e 2012-07-15        kinaba: 	{
45b72fc54e 2012-07-15        kinaba: 		int bp = max(0, (cast(int)plan.length)-10);
45b72fc54e 2012-07-15        kinaba: 		Game g = ini.clone();
45b72fc54e 2012-07-15        kinaba: 		for(int i=0; i<bp; ++i) g.command(plan[i]);
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 		Tuple!(string,long) cand = tuple(plan, unmod);
45b72fc54e 2012-07-15        kinaba: 		for(int i=bp; i<plan.length; ++i) {
45b72fc54e 2012-07-15        kinaba: 			foreach(char c; "UDLR")
45b72fc54e 2012-07-15        kinaba: 				if(c != plan[i]) {
45b72fc54e 2012-07-15        kinaba: 					Tuple!(string,long) zz = try_plan(c, g);
45b72fc54e 2012-07-15        kinaba: 					if(cand[1]<zz[1])
45b72fc54e 2012-07-15        kinaba: 						cand = tuple(plan[0..i]~c~zz[0], zz[1]);
45b72fc54e 2012-07-15        kinaba: 				}
45b72fc54e 2012-07-15        kinaba: 			g.command(plan[i]);
45b72fc54e 2012-07-15        kinaba: 		}
45b72fc54e 2012-07-15        kinaba: 		plan = cand[0];
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	Tuple!(string,long) try_plan(char c, in Game g)
45b72fc54e 2012-07-15        kinaba: 	{
45b72fc54e 2012-07-15        kinaba: 		Game gg = g.clone();
45b72fc54e 2012-07-15        kinaba: 		gg.command(c);
45b72fc54e 2012-07-15        kinaba: 		Tuple!(Solver, string) x = run_sub_solver(gg);
45b72fc54e 2012-07-15        kinaba: 		return tuple(x[1], x[0].g.score);
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	char single_step() {
45b72fc54e 2012-07-15        kinaba: 		if(plan.empty)
45b72fc54e 2012-07-15        kinaba: 			return 'A';
45b72fc54e 2012-07-15        kinaba: 		char c = plan[0];
45b72fc54e 2012-07-15        kinaba: 		plan = plan[1..$];
45b72fc54e 2012-07-15        kinaba: 		g.command(c);
45b72fc54e 2012-07-15        kinaba: 		return c;
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: 	void force(char c) {
45b72fc54e 2012-07-15        kinaba: 		g.command(c);
45b72fc54e 2012-07-15        kinaba: 		make_plan(g);
45b72fc54e 2012-07-15        kinaba: 	}
45b72fc54e 2012-07-15        kinaba: }
45b72fc54e 2012-07-15        kinaba: 
45b72fc54e 2012-07-15        kinaba: alias Solver_2!(Solver_1) MainSolver;
f6c126aeeb 2012-07-15        kinaba: //alias Solver_1 MainSolver;