class Nest { int[][] nestStructure; int xMin; int xMax; int yMin; int yMax; int xCenter; int yCenter; int xDir; int yDir; int currX; int currY; int xEnd; int yEnd; int passedEndXY; Nest(int maxSize) { nestStructure = new int[maxSize][maxSize]; for (int i=0; i=2) { xMin = xCenter-1; xMax = xCenter+1; yMin = yCenter-1; yMax = yCenter+1; xEnd++; currX = xCenter-1; currY = yCenter; xDir = 1; yDir = 0; passedEndXY = 0; println("NEXT LEVEL!!!!"); } currX += xDir; currY += yDir; int x = currX +xDir; //wie sähe der nächste schritt aus?? int y = currY +yDir; if (yDir == 1 && y == yCenter+1) { xMin--; xMax++; yMin--; yMax++; //####################### // currX = xCenter; // currY = yCenter; // xDir = 1; // yDir = 0; println("nächste schicht"); } if (x > xMax && y==yCenter && xDir ==1) { xDir = 0; yDir = 1; } else if (x > xCenter && y > yMax) //ecke rechts unten { xDir = -1; yDir = 0; } else if (x < xMin && y > yCenter) //ecke links unten { xDir = 0; yDir = -1; } else if (x < xCenter && y xMax && y < yCenter) //ecke rechts oben { xDir = 0; yDir = 1; } } void printNest() { println(); println("currX: "+currX +" currY: "+currY +" xMin: "+xMin +" yMin: "+yMin +" xEnd: "+ xEnd +" passedEndXY: " +passedEndXY); for (int k=0; k