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 Solvers40
Suggested Problems
-
Return the 3n+1 sequence for n
8525 Solvers
-
1781 Solvers
-
Back to basics 21 - Matrix replicating
1820 Solvers
-
218 Solvers
-
Solving Quadratic Equations (Version 1)
506 Solvers
More from this Author306
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!