FourthAssignmen & final
|mark_wiggley
.::[1]
Load NITROS .::NITROS?
.::[2]
Load to AutoCAD .::See
CODE:
There are 5 types of seeds to start the program. There
are 5 right hand rules. Each seeds only have one possible connecting
point,{tr_dn_Rn} all seeds can be recombined with
the other 5 seeds.n-->t(n+n) is the transformation
expression of this grammer. The number of possibility increase exponentially
by the number of steps. Object of game is to close the loop.
Post rationalization
This Grammer is Secular. There is no hierarchy...?
So it behaves chaotically. Since this project is alot like a traffic
circle, I can use some algorithms like "leaky bucket" to make this
(what is this), and not a whole bunch of accidents. The designer
can control such accidents.
There is no termination "col de sac" at
this point stop when you feel like it.
Further develop program will be able to Close
the loop automatically. My own interests I am hoping to have some
other rule that will create some kind of pattern...
|