philippe.lhardy/artloglaby
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add path view

Browse Source 
limit resolve depth ( to avoid infinite ).
to complete : horrible
This commit is contained in:
philippe lhardy
2017-11-29 23:09:32 +01:00
parent ce485f2263
commit 401c7e15d0
2 changed files with 181 additions and 72 deletions
Download Patch File Download Diff File Expand all files Collapse all files

179
java/org/artisanlogiciel/games/LabyModel.java
View File

@@ -28,13 +28,14 @@ public class LabyModel implements WallsProvider
private final static short FLAGLENGTH = 7;
private final static short CLEAR = 0; // mandatory 0 since array creation is
// initialized with 0.
private final static short HORIZONTAL = 1;
private final static short VERTICAL = 2;
private final static short DIRECTION = 4; // could we get rid of that to
public final static short HORIZONTAL = 1;
public final static short VERTICAL = 2;
public final static short DIRECTION = 4; // could we get rid of that to
// free one bit for other purpose
// ?
private final static short POSITIVE = 8;
private final static short NEGATIVE = 16;
public final static short POSITIVE = 8;
public final static short NEGATIVE = 16;
private final static short OPEN = 32; // can be reused once generation is
// completed
private final static short CLOSED = 64; // can be reused once generation is
@@ -52,7 +53,7 @@ public class LabyModel implements WallsProvider
// wall should
// be open to
// access this.
private final static short SOLVED = 64 << FLAGLENGTH; // flag when solution
public final static short SOLVED = 64 << FLAGLENGTH; // flag when solution
// is on this path.
private final static short FREE = 128 << FLAGLENGTH; // free flag
// remains 2 free bits ( keep one out for sign )
@@ -545,89 +546,100 @@ public class LabyModel implements WallsProvider
/**
* resolve this labrynth using internal representation
* initial (x,y) is exit, will return list of positions from start to end.
**/
public LinkedList<Position> resolve(int x, int y, MazeResolutionListener rlistener)
{
long safeguard = width * height;
int newx = x;
int newy = y;
// list of positions from start to end
LinkedList<Position> backpath = new LinkedList<Position>();
while (!((newx == 0) && (newy == 0)))
{
// position that point to (x,y).
Position found = null;
if (( x == newx ) && ( y == newy ))
{
System.out.println("[ERROR] path contains same consecutive point" + new Position(newx, newy).toString());
}
x = newx;
y = newy;
backpath.addFirst(new Position(x, y));
// should find from all direction one that point to this.
ArrayList<Short> freeDirection = new ArrayList<Short>();
// should find from all adjacent cells (directions) one that point to this.
{
ArrayList<Short> freeDirection = new ArrayList<Short>();
for (int didx = 0; didx < 4; didx++)
{
int delta = 0;
short direction = AllDirections[didx];
short reversedirection = AllDirections[(didx + 2) % 4];
short pointingdirection = DIRECTION;
// didx is index of four cell adjacent to this (x,y)
for (int didx = 0; didx < 4; didx++)
{
int delta = 0;
short direction = AllDirections[didx];
short reversedirection = AllDirections[(didx + 2) % 4];
short pointingdirection = DIRECTION;
if ((direction & POSITIVE) == POSITIVE)
{
delta = 1;
pointingdirection |= NEGATIVE;
}
else
{
delta = -1;
pointingdirection |= POSITIVE;
}
if ((direction & POSITIVE) == POSITIVE)
{
delta = 1;
pointingdirection |= NEGATIVE;
}
else
{
delta = -1;
pointingdirection |= POSITIVE;
}
if ((direction & HORIZONTAL) == HORIZONTAL)
{
newx = x + delta;
newy = y;
pointingdirection |= HORIZONTAL;
}
else
{
newy = y + delta;
newx = x;
pointingdirection |= VERTICAL;
}
if ((direction & HORIZONTAL) == HORIZONTAL)
{
newx = x + delta;
newy = y;
pointingdirection |= HORIZONTAL;
}
else
{
newy = y + delta;
newx = x;
pointingdirection |= VERTICAL;
}
// internal GUARD.
if ((reversedirection & pointingdirection) != pointingdirection)
{
System.out.println("Internal ERROR. Please check AllDirections order "
+ (reversedirection & pointingdirection) + " " + pointingdirection);
return backpath;
}
// internal GUARD.
if ((reversedirection & pointingdirection) != pointingdirection)
{
System.out.println("Internal ERROR. Please check AllDirections order "
+ (reversedirection & pointingdirection) + " " + pointingdirection);
return backpath;
}
if ((newx >= 0) && (newy >= 0) && (newx < width) && (newy < height))
{
if ((t[newx][newy] & reversedirection) == reversedirection)
{
if (found != null)
{
// could be a unique parent of two paths...
// but search from other entry/exits than generated
// from
// ie entry(0,0) exit(width-1,height-1) not yet
// implemented.
if (rlistener != null)
{
rlistener.notifySearchError("Model Error : two parents " + found.toString() + " "
+ new Position(newx, newy).toString());
}
return backpath;
}
found = new Position(newx, newy);
if (rlistener != null)
{
rlistener.notifySearch(found);
}
break;
}
}
}
if ((newx >= 0) && (newy >= 0) && (newx < width) && (newy < height))
{
if ((t[newx][newy] & reversedirection) == reversedirection)
{
if (found != null)
{
// could be a unique parent of two paths...
// but search from other entry/exits than generated
// from
// ie entry(0,0) exit(width-1,height-1) not yet
// implemented.
if (rlistener != null)
{
rlistener.notifySearchError("Model Error : two parents " + found.toString() + " "
+ new Position(newx, newy).toString());
}
return backpath;
}
found = new Position(newx, newy);
if (rlistener != null)
{
rlistener.notifySearch(found);
}
break;
}
}
}
}
if (found == null)
{
rlistener.notifySearchError("No path found !");
@@ -636,7 +648,22 @@ public class LabyModel implements WallsProvider
// System.out.println(found);
newx = found.getX();
newy = found.getY();
t[newx][newy] |= SOLVED;
if ( ( t[newx][newy] & SOLVED ) == SOLVED )
{
System.out.println("[INFO] position already solved" + new Position(newx, newy).toString() + " *length:" + backpath.size());
}
else
{
t[newx][newy] |= SOLVED;
}
safeguard --;
if ( safeguard < 0 )
{
rlistener.notifySearchError("Path too long ( or long overflow ) for width*height:" + (width*height) + " length:" + backpath.size());
break;
}
}
if (rlistener != null)
{
@@ -813,6 +840,16 @@ public class LabyModel implements WallsProvider
return walls;
}
public short getPath(int x, int y)
{
short path = 0;
if (( x < width ) && ( y < height ))
{
path = t[x][y];
}
return path;
}
/**
* is there a wall in that direction ?
**/