The Langston's Ant Challenge is to determine the number of Black squares after K Ant moves.
An infinite white board has an Ant at the center. Direction is not required.
Movement and Affect:
1) At a white square, turn 90° right, White goes to Black, move forward one unit 2) At a black square, turn 90° left, Black goes to White, move forward one unit
After a given number of moves how many Black squares are present.
Input: K, number of moves from 100 to 12000
Output: BLK, number of Black squares
Example: K=5, BLK=3 [00000;00010;00110]
Note: After 11000 moves a pattern emerges
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers39
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15784 Solvers
-
Who knows the last digit of pi?
691 Solvers
-
Number of 1s in a binary string
11079 Solvers
-
Compute a dot product of two vectors x and y
1050 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
684 Solvers
More from this Author309
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!