package langton;

import java.awt.Point;
import java.util.HashMap;

public class LangtonsAnt
{
  private final Point[] directions =
  {
    new Point(1, 0),
    new Point(0, 1),
    new Point(-1, 0),
    new Point(0, -1)
  };

  private Point ant;                      // The ant's position
  private int direction = 0;              // The ant's direction
  private HashMap<Point, Boolean> field;  // The field which the ant moves on

  public LangtonsAnt()
  {
    // Create a new Map to hold coordinates for ant
    field = new HashMap<Point, Boolean>();
  }

  public void step()
  {
    // If the ant is on a black square
    if (field.get(ant))
    {
      direction = (direction - 1) % 4;
      field.put(ant, false);
    }
    else  // If the ant is on a white spot
    {
      direction = (direction + 1) % 4;
      field.put(ant, true);
    }

    ant.translate(directions[direction].x,
                  directions[direction].y);
  }

  public static void main(String[] args)
  {
  }
}

@@ -383,21 +383,21 @@
 oolean%3E 
-field
+plane
 ;  // Th
@@ -398,21 +398,21 @@
  // The 
-field
+plane
  which t
@@ -511,21 +511,21 @@
 ant%0A    
-field
+plane
  = new H
@@ -549,24 +549,146 @@
 lean%3E();%0A  %7D
+%0A  %0A  public Point getAnt()%0A  %7B%0A    return ant;%0A  %7D%0A%0A  public HashMap%3CPoint, Boolean%3E getPlane()%0A  %7B%0A    return plane;%0A  %7D
 %0A%0A  public v
@@ -749,21 +749,21 @@
     if (
-field
+plane
 .get(ant
@@ -808,37 +808,37 @@
 - 1) %25 4;%0A      
-field
+plane
 .put(ant, false)
@@ -943,13 +943,13 @@
     
-field
+plane
 .put
@@ -1011,16 +1011,16 @@
 ion%5D.x,%0A
+
         
@@ -1062,57 +1062,7 @@
 %0A  %7D
-%0A%0A  public static void main(String%5B%5D args)%0A  %7B%0A  %7D
 %0A%7D%0A

Add getPlane-method. Returns the plane which the ant moves on