Content deleted Content added
Line 16:
:The paper "fractals, graphs and fields" by Franklin Mendivil [http://mathdl.maa.org/mathDL/22/?pa=content&sa=viewDocument&nodeId=3128] explained the two methods and their equivalence very well. Recommended if there's others out there getting confused. :-) The construction paragraph seems correct, though it leaves out a lot of detail. [[User:EverGreg|EverGreg]] ([[User talk:EverGreg|talk]]) 19:40, 26 December 2009 (UTC)
to EverGreg:
Line 25 ⟶ 23:
If you have 3 transformations and you want sequences of length 10, you have 3^10 possible sequences of transformations. Given a common (arbitrary) starting point, this will yield 3^10 end points. Those 3^10 end points are plotted and make your fractal. [[Special:Contributions/46.64.181.38|46.64.181.38]] ([[User talk:46.64.181.38|talk]]) 14:11, 19 April 2014 (UTC)
::Right. Another way of looking at it is that the chaos-game algorithm is a random depth-first "search" that never backtracks, while Method 2 is an exhaustive search up to a given depth. But yes, this paragraph is super unclear. I just improved it slightly, but a '''lot''' more work is needed. [[User:Kragen|Kragen Javier Sitaker]] ([[User talk:Kragen|talk]]) 05:49, 19 July 2014 (UTC)
==Example==
| |||