#include<iostream>
#include<fstream>
#include<queue>
using namespace std;
int map[40][40];
int ok(int s,int t){
return (s-1)*6+t;
}
struct e{
int s,t;
};
int pre[7][7];
int pre1[7][7];
int pre2[7][7];
int sx,sy,ex,ey;
int move[4][2]={0,1,0,-1,1,0,-1,0};
int v[7][7];
void pr(int s){
if(s==0) cout<<'S';
if(s==1) cout<<'N';
if(s==2) cout<<'E';
if(s==3) cout<<'W';
}
void print(int s,int t){
if(pre[s][t]!=-1)
{
print(pre1[s][t],pre2[s][t]);
pr(pre[s][t]);
}
}
void solve(){
int i,j,k,x,y;
e a;
a.s=sx;
a.t=sy;
queue<e> q;
q.push(a);
pre[sx][sy]=-1;
memset(v,0,sizeof(v));
v[sx][sy]=1;
while(!q.empty())
{
a=q.front();
q.pop();
if(a.s==ex&&a.t==ey)
break;
for(i=0;i<4;i++)
{
x=a.s+move[i][0];
y=a.t+move[i][1];
if(x>=1&&x<=6&&y>=1&&y<=6&&map[ok(a.s,a.t)][ok(x,y)]==0&&v[x][y]==0)
{
e b;
b.s=x;
b.t=y;
v[x][y]=1;
pre[x][y]=i;
pre1[x][y]=a.s;
pre2[x][y]=a.t;
q.push(b);
}
}
}
print(ex,ey);
cout<<endl;
}
void read(){
// ifstream cin("in.txt");
int i,j,k,x,y,x1,y1;
while(cin>>sx>>sy)
{
if(sx==0&&sy==0) return;
cin>>ex>>ey;
memset(map,0,sizeof(map));
for(k=1;k<=3;k++)
{
cin>>x>>y>>x1>>y1;
if(x==x1&&!(x==0||x==6))
{
for(i=min(y,y1)+1;i<=max(y,y1);i++)
{
map[ok(x,i)][ok(x+1,i)]=1;
map[ok(x+1,i)][ok(x,i)]=1;
}
}
if(y==y1&&!(y==0||y==6))
{
for(i=min(x,x1)+1;i<=max(x,x1);i++)
{
map[ok(i,y)][ok(i,y+1)]=1;
map[ok(i,y+1)][ok(i,y)]=1;
}
}
}
solve();
}
}
int main(){
read();
return 0;
}
转载于:https://www.cnblogs.com/zhaozhe/archive/2011/07/07/2099906.html