Let D0 be the two-letter string "Fa". For n≥1, derive Dn from Dn-1 by the string-rewriting rules:
"a" → "aRbFR"
"b" → "LFaLb"
Thus, D0 = "Fa", D1 = "FaRbFR", D2 = "FaRbFRRLFaLbFR", and so on.
These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1).
Then Dn is an exotic drawing known as the Heighway Dragon of order n. For example, D10 is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
What is the position of the cursor after 1012 steps in D50 ?
Give your answer in the form x,y with no spaces.
1. make this way using by phyton and turtle.
2. think more deeply to solve it.
3. I have to find pattern or math skill.
wn = turtle.Screen() # Creates a playground for turtles
tt = turtle.Turtle() # Create a turtle, assign to alex
for i inrange(14):
s = s.replace('a', 't')
s = s.replace('b', 'p')
s = s.replace('t', a)
s = s.replace('p', b)
if i ==9:
for d inrange(len(s)):
if s[d-1] =='F':
elif s[d-1] =='L':
elif s[d-1] =='R':
wn.mainloop() # Wait for user to close window