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 comments
Loading...
Problem Recent Solvers38
Suggested Problems
-
994 Solvers
-
Back to basics 9 - Indexed References
461 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
449 Solvers
-
Generate a random matrix A of (1,-1)
402 Solvers
-
1916 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!