Langston's Ant - Revision history

Legg at 18:12, 27 May 2021

2021-05-27T18:12:23Z

Legg at 17:22, 27 May 2021

2021-05-27T17:22:40Z

Legg: Created page with "==Synopsis== Performs a simulation of Langston's Ant ==Notes== There are no borders, the map wraps edge to edge. Define statements have a 11x11 grid and 10 steps. The ANT..."

2021-05-27T16:54:04Z

Created page with "==Synopsis== Performs a simulation of Langston's Ant ==Notes== There are no borders, the map wraps edge to edge. Define statements have a 11x11 grid and 10 steps. The ANT..."

New page

==Synopsis==

Performs a simulation of Langston's Ant

==Notes==

There are no borders, the map wraps edge to edge. Define statements have a 11x11 grid and 10 steps. The ANT always starts at, or near, the center.

==Compilation==
<syntaxhighlight lang="bash">
gcc -o Ant Ant.c
</syntaxhighlight>
==Code==
<syntaxhighlight lang="C++" line='line'>
#include<stdio.h>
#define X 11
#define Y 11
#define S 10

void main(void)
{
char world[X][Y];
unsigned short x, y, c, d, h, s;
//init
x=X/2; y=Y/2; h=0;
for(c=0;c<Y;c++)
{
for(d=0;d<X;d++)
{
world[d][c] = ' ';
}
}

//loop
for(s=0;s<S;s++)
{
//print current state
printf("S=%d\n\n",s+1);
printf("%c", '/');
for(c=0;c<X;c++)
{
printf("%c", '-');
}
printf("%c\n", '\\');
for(c=0;c<Y;c++)
{
printf("%c", '|');
for(d=0;d<X;d++)
{
if(d==x && c==y)
printf("A");
else
printf("%c",world[d][c]);
}
printf("%c\n", '|');
}
printf("%c", '\\');
for(c=0;c<X;c++)
{
printf("%c", '-');
}
printf("/\n\n");
//turn logic
if(world[x][y]==' ')
{
h++; //CW
h = h % 4;
world[x][y]='*';
}
else
{
h--; //CCW
h= h % 4;
world[x][y]=' ';
}
//move forward
if(h==0)
y = (y - 1) % Y;
if(h==2)
y = (y + 1) % Y;
if(h==1)
x = (x + 1) % X;
if(h==3)
x = (x - 1) % X;

}

//terminate
printf("\nEOS \n");
return;
}
</syntaxhighlight>

@@ Line 16: / Line 16: @@
 #define X 11
 #define Y 11
-#define S 10
+#define S 240
 void main(void)
@@ Line 23: / Line 23: @@
 	unsigned short x, y, c, d, h, s;
 	//init
-	x=X/2; y=Y/2; h=0;
+	x=X/2; y=Y/2; h=3;
 	for(c=0;c<Y;c++)
+	{
 		for(d=0;d<X;d++)
+		{
-			world[d][c] = ' ';
+			world[d][c] = '.';
+		}
+	}
@@ Line 62: / Line 62: @@
 		printf("/\n\n");
 		//turn logic
-		if(world[x][y]==' ')
+		if(world[x][y]=='.')
+		{
 			h++; //CW
@@ Line 72: / Line 72: @@
 			h--; //CCW
 			h= h % 4;
-			world[x][y]=' ';
+			world[x][y]='.';
+		}
 		//move forward
 		if(h==0)
-			y = (y - 1) % Y;
+			{if(y==0) y=Y-1; else y--;}
 		if(h==2)
-			y = (y + 1) % Y;
+			{if(y==Y-1) y=0; else y++;}
 		if(h==1)
-			x = (x + 1) % X;
+			{if(x==X-1) x=0; else x++;}
 		if(h==3)
-			x = (x - 1) % X;
+			{if(x==0) x=X-1; else x--;}
+	}

@@ Line 5: / Line 5: @@
 ==Notes==
-There are no borders, the map wraps edge to edge.  Define statements have a 11x11 grid and 10 steps.  The ANT always starts at, or near, the center.
+There are no borders, the map wraps edge to edge.  Define statements have a 11x11 grid and 10 steps.  The ANT always starts at, or near, the center.  The ant defaults being oriented towards north as an initial condition.
 ==Compilation==