import util;
import game;
bool rocky(char c){ return c=='*'||c=='@'; }
interface Solver
{
// this(in Game g);
char single_step();
void force(char c);
}
class Solver_0 : Solver
{
this(in Game g) {}
char single_step() { return 'W'; }
void force(char c) {}
}
class Solver_1 : Solver
{
int wait_count = 0;
int choke_count = 0;
Game g;
this(in Game g)
{
this.g = g.clone();
forbidden_cell = new bool[][](g.map.H+2, g.map.W+2);
}
char single_step()
{
Tuple!(string,int) de = death_move(g);
char c = act(g, de[0], de[1]);
force(c);
return c;
}
void force(char c)
{
if(c != 'A')
g.command(c);
}
Tuple!(string,int) death_move(const(Game) g)
{
string death;
int choice = 0;
foreach(char c; "UDLRW") {
Game gg = g.clone();
gg.command(c);
if( !gg.cleared && gg.dead )
death ~= c;
else if( gg.map.robot != g.map.robot )
choice++;
else if( c != 'W' ) // meaningless move
death ~= c;
}
return tuple(death, choice);
}
Tuple!(Pos, int)[] log;
bool[][] forbidden_cell;
char act(const(Game) g, string death, int breath)
{
const Pos ro = g.map.robot;
const Pos li = g.map.lift;
Pos[] la = g.map.lambdas();
sort!((Pos a,Pos b){
int ad=abs(a.y-li.y)+abs(a.x-li.x);
int bd=abs(b.y-li.y)+abs(b.x-li.x);
return ad>bd;;
})(la);
Pos[] ra = g.map.razors();
const(Pos)[] hi = g.map.objects('W');
Tuple!(char,int)[] cand;
char c = 'W';
if( g.map.collected_lambda == g.map.total_lambda ) {
cand = search(g, ro, [li], death);
} else if( !la.empty ){
cand ~= search(g, ro, la~ra, death);
}
// 'higesori' mode
if( !hi.empty && g.map.razor>0 ) {
int his = 0;
for(int dy=-1; dy<=+1; ++dy)
for(int dx=-1; dx<=+1; ++dx)
if(g.map[ro.y+dy,ro.x+dx] == 'W')
his++;
if(his>=2 || his==hi.length)
cand = [tuple('S',int.max)];
if(cand.empty) {
const(Pos)[] tgt;
for(int y=1; y<=g.map.H; ++y)
for(int x=1; x<=g.map.W; ++x)
if(g.map[y,x]=='.'||g.map[y,x]==' ') {
his = 0;
for(int dy=-1; dy<=+1; ++dy)
for(int dx=-1; dx<=+1; ++dx)
if(g.map[y+dy,x+dx] == 'W')
his++;
if(his>=2)
tgt ~= new Pos(y,x);
}
cand ~= search(g, ro, tgt, death, true);
}
}
// 'dig' mode
if(cand.empty) {
const(Pos)[] tgt;
for(int y=1; y<=g.map.H; ++y)
for(int x=1; x<=g.map.W; ++x)
if(g.map[y,x]=='.')
if(rocky(g.map[y+1,x])||rocky(g.map[y+1,x-1])||rocky(g.map[y+1,x+1])
||rocky(g.map[y,x+1])||rocky(g.map[y,x-1]))
tgt ~= new Pos(y,x);
cand ~= search(g, ro, tgt, death, true);
}
if(cand.empty) {
choke_count++;
cand ~= tuple('W',int.max);
}
sort!((Tuple!(char,int) c1, Tuple!(char,int) c2){
if(c1[1] != c2[1])
return c1[1] < c2[1];
return c1[0] < c2[0];
})(cand);
c = cand[0][0];
if(death.count(c) || wait_count>=2) {
foreach(char live; "UDLRW")
if(death.count(live)==0) {
c=live;
break;
}
}
if(c == 'W')
wait_count++;
else
wait_count = 0;
if(wait_count==2)
c = 'A';
if(choke_count >= g.map.H)
c = 'A';
bool[char] choice;
foreach(t; cand)
choice[t[0]] = true;
log ~= tuple(ro.clone(), cast(int)choice.length);
if(log.length > 5)
log = log[$-5..$];
int cnt = 0;
foreach(l; log)
if(l[0] == log[$-1][0])
++cnt;
if( cnt >= 3 && breath==1 ) {
forbidden_cell[ro.y][ro.x] = true;
}
return c;
}
Tuple!(char,int)[] search(in Game g, in Pos s, in Pos[] gs, string death, bool danger_ok=false)
{
bool danger(int y, int x)
{
if(g.map[y,x] == ' ' || g.map[y,x] == 'R')
return false;
if(rocky(g.map[y+1,x]))
return true;
if(rocky(g.map[y+1,x-1]) && (g.map[y,x-1]=='\\'||rocky(g.map[y,x-1]))
&& (g.map[y+1,x]==' '||g.map[y+1,x]=='R'))
return true;
if(rocky(g.map[y+1,x+1]) && rocky(g.map[y,x+1]) && (g.map[y+1,x]==' '||g.map[y+1,x]=='R'))
return true;
if(rocky(g.map[y,x-1]) && (g.map[y-1,x-1]=='\\'||rocky(g.map[y-1,x-1]))
&& (g.map[y-1,x]==' '||g.map[y-1,x]=='R'))
return true;
if(rocky(g.map[y,x+1]) && rocky(g.map[y-1,x+1]) && (g.map[y-1,x]==' '||g.map[y-1,x]=='R'))
return true;
return false;
}
// avoid directly below '*'
Tuple!(char,int)[] tryA() {
const(Pos)[] q;
foreach(p; gs)
if(!danger(p.y,p.x))
q ~= p;
bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
foreach(p; q) v[p.y][p.x]=true;
for(int step=1; q.length; ++step) {
Pos[] q2;
foreach(p; q) {
int[] yyy=[p.y-1,p.y+1,p.y,p.y];
int[] xxx=[p.x,p.x,p.x-1,p.x+1];
for(int i=0; i<yyy.length; ++i) {
int y = yyy[i];
int x = xxx[i];
if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
foreach(ppp; g.tr.source_pos(g.map[y,x])) {
yyy ~= ppp.y;
xxx ~= ppp.x;
}
continue;
}
if(v[y][x]) continue;
if(y==s.y && x==s.x && i<4) {
char c = "UDRL"[i];
if( death.count(c) == 0 )
return [tuple(c,step)];
} else if(forbidden_cell[y][x]){
} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||g.map[y,x]=='!'||i>=4) {
if(danger(y,x))
continue;
q2 ~= new Pos(y,x);
v[y][x]=true;
}
}
}
q = q2;
}
return [];
}
// any empty space is my ground
Tuple!(char,int)[] tryB() {
const(Pos)[] q;
foreach(p; gs) q ~= p;
bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
foreach(p; q) v[p.y][p.x]=true;
for(int step=10; q.length; ++step) {
Pos[] q2;
foreach(p; q) {
int[] yyy=[p.y-1,p.y+1,p.y,p.y];
int[] xxx=[p.x,p.x,p.x-1,p.x+1];
for(int i=0; i<yyy.length; ++i) {
int y = yyy[i];
int x = xxx[i];
if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
foreach(ppp; g.tr.source_pos(g.map[y,x])) {
yyy ~= ppp.y;
xxx ~= ppp.x;
}
continue;
}
if(v[y][x]) continue;
if(y==s.y && x==s.x && i<4) {
char c = "UDRL"[i];
if( death.count(c) == 0 )
return [tuple(c,step)];
} else if(forbidden_cell[y][x]){
} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||g.map[y,x]=='!'||i>=4) {
q2 ~= new Pos(y,x);
v[y][x]=true;
}
}
}
q = q2;
}
return [];
}
// push rocks!
Tuple!(char,int)[] tryC() {
const(Pos)[] q;
foreach(p; gs) q ~= p;
bool[][] v = new bool[][](g.map.H+2, g.map.W+2);
foreach(p; q) v[p.y][p.x]=true;
for(int step=20; q.length; ++step) {
Pos[] q2;
foreach(p; q) {
int[] yyy=[p.y-1,p.y+1,p.y,p.y];
int[] xxx=[p.x,p.x,p.x-1,p.x+1];
for(int i=0; i<yyy.length; ++i) {
int y = yyy[i];
int x = xxx[i];
if(rocky(g.map[p])) {
if(i>=4)continue;
if(y!=p.y)continue;
if(g.map[y,p.x+(p.x-x)]!=' '&&g.map[y,p.x+(p.x-x)]!='R')continue;
}
if('1'<=g.map[y,x]&&g.map[y,x]<='9') {
foreach(ppp; g.tr.source_pos(g.map[y,x])) {
yyy ~= ppp.y;
xxx ~= ppp.x;
}
continue;
}
if(v[y][x]) continue;
if(y==s.y && x==s.x && i<4) {
char c = "UDRL"[i];
if( death.count(c) == 0 )
return [tuple(c,step)];
} else if(forbidden_cell[y][x]){
} else if(g.map[y,x]==' '||g.map[y,x]=='\\'||g.map[y,x]=='.'||rocky(g.map[y,x])||g.map[y,x]=='!'||i>=4) {
q2 ~= new Pos(y,x);
v[y][x]=true;
}
}
}
q = q2;
}
return [];
}
return (danger_ok ? [] : tryA()) ~ tryB() ~ tryC();
}
}
class Solver_2(SubSolver) : Solver
{
// Parameters.
int PredictFuture = 10;
const string[] RandomChoicePattern; // PF*RCP exhaustive search for RL steps
const ReplanLength = 400; // O(PF*RCP*RL*SubSolver.single_step)
Game current_game;
SubSolver sub_solver;
enum {Tentative, Tentative_Stuck, Fixed};
string plan;
int plan_state;
int replan_limit;
bool lambda_getter;
int clear_improvement = 3;
this(in Game g)
{
current_game = g.clone();
plan = "";
plan_state = Tentative;
replan_limit = PredictFuture;
if(g.map.W*g.map.H <= 400)
RandomChoicePattern = ["UU","UD","UL","UR",
"DU","DD","DL","DR",
"LU","LD","LL","LR",
"RU","RD","RL","RR","UUU","UUUU","UUUUU"];
else if(g.map.W*g.map.H <= 4096)
RandomChoicePattern = ["UUU","U","D","L","R","UD","DU","LR","RL"];
else
RandomChoicePattern = ["U","D","L","R"];
if(g.map.W*g.map.H <= 400)
PredictFuture = 20;
else
PredictFuture = 10;
}
char single_step()
{
if(current_game.dead || current_game.cleared)
return 'A';
// Make enough prediction.
while( plan_state==Tentative && plan.length<replan_limit )
single_step_predict();
// If the future is bad, correct.
if( plan_state==Tentative_Stuck && plan.length<replan_limit && !lambda_getter )
replan();
// Follow the predicted plan.
if( plan.empty )
return 'A';
stderr.writeln(plan, " ", plan_state);
char c = plan[0];
plan = plan[1..$];
int b_lambda = current_game.map.collected_lambda;
current_game.command(c);
int a_lambda = current_game.map.collected_lambda;
if(b_lambda < a_lambda) lambda_getter = false;
return c;
}
void force(char c)
{
if(plan.length>0 && plan[0]==c)
{
// If matching the plan, just go forward.
plan = plan[1..$];
}
else
{
// Discard the plan, otherwise.
plan_state = Tentative;
plan = "";
sub_solver = null;
}
current_game.command(c);
}
void single_step_predict()
{
if(sub_solver is null) {
sub_solver = new SubSolver(current_game);
plan = "";
}
char c = sub_solver.single_step();
if(c == 'A')
plan_state = Tentative_Stuck;
else {
plan ~= c;
plan_state = (sub_solver.g.dead ? Tentative_Stuck :
sub_solver.g.cleared ? Fixed : Tentative);
}
}
void replan()
{
stderr.writeln("replan!");
// Try to replace every step of the plan by another move.
Game g = current_game.clone();
Tuple!(SubSolver, string, int) cand = tuple(sub_solver, plan, Tentative_Stuck);
int insertion_point = plan.length;
writeln(cand, " ", cand[0].g.map.collected_lambda);
bool tiebreak_by_turn = false;
for(int i=0; i<plan.length; ++i) {
foreach(string prefix; RandomChoicePattern)
if(prefix[0] != plan[i]) {
Tuple!(SubSolver, string, int) r = try_plan(g, prefix);
r[1] = plan[0..i] ~ prefix ~ r[1];
bool better = false, tbt=false;
if(!cand[0].g.cleared && r[0].g.cleared)
better = true;
else if(cand[0].g.cleared && r[0].g.cleared) {
better = cand[0].g.score < r[0].g.score;
}
else if(!cand[0].g.cleared && !r[0].g.cleared) {
if(cand[0].g.map.collected_lambda < r[0].g.map.collected_lambda)
better = true;
else if(cand[0].g.map.collected_lambda == r[0].g.map.collected_lambda) {
if(cand[0].g.dead && !r[0].g.dead)
better = true;
else if(cand[0].g.dead == r[0].g.dead) {
better = (cand[1].length < r[1].length && r[2]!=Tentative_Stuck);
tbt = true;
}
}
}
if(better) {
cand = r;
tiebreak_by_turn = true;
insertion_point = i+prefix.length;
writeln(cand, " ", cand[0].g.map.collected_lambda);
}
}
g.command(plan[i]);
}
if(cand[2]==Fixed && insertion_point!=plan.length && clear_improvement-->0) {
sub_solver = cand[0];
plan = cand[1];
plan_state = Tentative_Stuck;
replan_limit = (plan.length - insertion_point);
lambda_getter = current_game.map.collected_lambda < cand[0].g.map.collected_lambda;
} else {
sub_solver = cand[0];
plan = cand[1];
plan_state = (plan.length < PredictFuture ? Fixed : cand[2]);
replan_limit = tiebreak_by_turn ? min(PredictFuture, plan.length/2) : PredictFuture;
lambda_getter = current_game.map.collected_lambda < cand[0].g.map.collected_lambda;
}
}
Tuple!(SubSolver, string, int) try_plan(in Game g, string prefix)
{
SubSolver s = new SubSolver(g);
foreach(char c; prefix)
s.force(c);
string log;
int state = Tentative;
while(!s.g.cleared && !s.g.dead && log.length<=ReplanLength && log.length<=g.map.W*g.map.H) {
char c = s.single_step();
if( c == 'A' ) {
state = Tentative_Stuck;
break;
}
log ~= c;
}
if(s.g.cleared) state = Fixed;
else if(s.g.dead) state = Tentative_Stuck;
return tuple(s, log, state);
}
}
alias Solver_2!(Solver_1) MainSolver;
//alias Solver_1 MainSolver;
//alias Solver_0 MainSolver;