不錯的博弈題
//====================================================================||
// Name : Game of Euler.cpp ||
// Date : 2013/7/19 下午8:22:10 ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 10011
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
char mz\[5\]\[5\];
int dp\[1<<16\];
bool dfs(){
bool over=true;
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(mz\[i\]\[j\]!='X'){over=false;break;}
}
}
if(over)return false;
int tmp=0;
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(mz\[i\]\[j\]=='.')tmp|=1<<(i\*4+j);
}
}
if(dp\[tmp\]!=-1)return dp\[tmp\];
bool win=true;
bool canpin=true;
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(i==0||i==3||j==0||j==3){
for(int k=0;k<3;k++){
if(j==0){
canpin=true;
for(int p=0;p<=k;p++){
if(j+p<0||j+p>=4){canpin=false;break;}
if(mz\[i\]\[j+p\]!='.'){canpin=false;break;}
}
if(canpin){
for(int p=0;p<=k;p++){
mz\[i\]\[j+p\]='X';
}
if(dfs())win=false;
for(int p=0;p<=k;p++){
mz\[i\]\[j+p\]='.';
}
}
}
if(j==3){
canpin=true;
for(int p=0;p<=k;p++){
if(j-p<0||j-p>=4){canpin=false;break;}
if(mz\[i\]\[j-p\]!='.'){canpin=false;break;}
}
if(canpin){
for(int p=0;p<=k;p++){
mz\[i\]\[j-p\]='X';
}
if(dfs())win=false;
for(int p=0;p<=k;p++){
mz\[i\]\[j-p\]='.';
}
}
}
if(i==3){
canpin=true;
for(int p=0;p<=k;p++){
if(i-p<0||i-p>=4){canpin=false;break;}
if(mz\[i-p\]\[j\]!='.'){canpin=false;break;}
}
if(canpin){
for(int p=0;p<=k;p++){
mz\[i-p\]\[j\]='X';
}
if(dfs())win=false;
for(int p=0;p<=k;p++){
mz\[i-p\]\[j\]='.';
}
}
}
if(i==0){
canpin=true;
for(int p=0;p<=k;p++){
if(i+p<0||i+p>=4){canpin=false;break;}
if(mz\[i+p\]\[j\]!='.'){canpin=false;break;}
}
if(canpin){
for(int p=0;p<=k;p++){
mz\[i+p\]\[j\]='X';
}
if(dfs())win=false;
for(int p=0;p<=k;p++){
mz\[i+p\]\[j\]='.';
}
}
}
}
}
else{
if(mz\[i\]\[j\]=='.'){
mz\[i\]\[j\]='X';
if(dfs())win=false;
mz\[i\]\[j\]='.';
}
}
}
}
// for(int i=0;i<4;i++){
// puts(mz\[i\]);
// }printf("%d\\n",win);
return (dp\[tmp\]=win);
}
void solve(){
int tmp=0;
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(mz\[i\]\[j\]=='.')tmp|=(1<<(i\*4+j));
}
}
dfs();
printf("%s\\n",(dp\[tmp\])?"LOSING":"WINNING");
}
int main() {
Set(dp,-1);
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d%\*c%\*c",&test);
while(test--){
for(int i=0;i<4;i++){
scanf("%s%\*c",mz\[i\]);
}getchar();
solve();
}
}