#Dead?
Richie's goal in writing this Mandelbrot program is to prove that you can
achieve a greater computational power by using better algorithms, not resorting
to brute force. MandFXP is a brute force approach; it is coded in assembler (I
think) and uses fixed point math. Richie's program is in M2 and uses the
standard FFP routines. It is indeed much faster than a conventional Mandelbrot
program, but I have my doubts whether it can match the brute force method in
this case. Now, I would LOVE to see Richie's algorithm used in the MandFXP
program; the thing should FLY!
(to set the record straight, the algorithm was originally conceived by
a coworker of ours, Peter Trei).
– Steve –