|
|
|
|
|
|
|
|
|
I have found that n is directly proportional to how often S is in proximity to G.
If S has < visits to G, then the ability to acquire more n increases. Subsequently, after keeping S away from G for a significant amount of time, you end up with nē. If S, is in proximity to G and notices nē, then you are in some serious trouble with S. ![]() Basically the algorithm is something like this: S + G (nē) = nosex Some of you may be able to avoid the answer above with application of F. Brett ![]() F = flowers |
|
|
|
|
||
|
|
Quote:
|
|
|
||
|
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Cool How do you know when there is enough lift? | aeajr | Slope | 59 | Dec 20, 2009 07:44 PM |
| Discussion When is enough...enough... | Bunyan | Mini Helis | 63 | Jan 31, 2007 03:44 PM |
| When is enough enough??? | soholingo | High Performance | 48 | Jan 15, 2005 03:30 PM |
| When is Enough...Enough? | DEPENDS | Parkflyers | 16 | Apr 08, 2003 10:38 PM |
| Enough is Enough!! | someone special | Foamies (Kits) | 6 | Aug 08, 2002 04:33 AM |