Problem 2147. Langston's Ant

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Langton%27s_ant\"><w:r><w:t>Langston's Ant</w:t></w:r></w:hyperlink><w:r><w:t> Challenge is to determine the number of Black squares after K Ant moves.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>An infinite white board has an Ant at the center. Direction is not required.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Movement and Affect:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1) At a white square, turn 90° right, White goes to Black, move forward one unit\n2) At a black square, turn 90° left, Black goes to White, move forward one unit]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>After a given number of moves how many Black squares are present.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> K, number of moves from 100 to 12000</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> BLK, number of Black squares</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r><w:r><w:t> K=5, BLK=3 [00000;00010;00110]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Note:</w:t></w:r><w:r><w:t> After 11000 moves a pattern emerges</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

140 Solutions
29 Solvers

Last Solution submitted on Oct 28, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 396883

1 Comment

1 Comment

Jan Orwat on 4 Feb 2014

different point of view, literally

Solution 395616

1 Comment

1 Comment

Bart on 2 Feb 2014

Damn, re-submitted Richards code. Was not my intention, sorry.

Problem Recent Solvers29

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2147. Langston's Ant

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers29

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 2147. Langston's Ant

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers29

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players