ards to the number before the start number...
i.e. 9, 0, 1, 2, 3, 4, 5, 6, 7, 8
then it will need to repeat this pattern (continuing to count upwards) and the repeat number is based on a slider (for example 3 in the case illustrated below):
9, 0, 1, 2, 3, 4, 5, 6, 7, 8
19, 10, 11, 12, 13, 14, 15, 16, 17, 18,
29, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
if anyone has any ideas on how to create this series it would be great
M.…
. etc. So it's 80020 which is ~1058. Assuming you're allowed to use the same component more than once.
1058 × 1049 = 10107 total possible algorithms. When talking about big numbers I only have three frames of reference. The distance from us to the edge of the observable universe is roughly 1029 millimeters, the observable universe contains 1080 protons and the volume of the observable universe is roughly 5×10105 cubic nanometers. So you could more or less put a different valid Grasshopper algorithm into every cubic nanometer of this universe.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…