well lets start with Real domain and integer b only: a^^b = a^a^a^a^a…^a // a is there b times this can be evaluated like this in C++: double tetration(double a,int b) // a^^b = a^a^a^a… b times { double c; if (b<=0) return 0; for (c=a;b>1;b–) c=pow(a,c); return c; } as You already got the … Read more
Have a try and define a master: PhotoImage(master = canvas, width = WIDTH, height = HEIGHT) If you do not define a master then this image uses the first Tk() which is created and if that Tk is deleted there is no image to display. Tell me if it works, I am guessing.
This is the smooth color algorithm: Lets say you start with the complex number z0 and iterate n times until it escapes. Let the end point be zn. A smooth value would be nsmooth := n + 1 – Math.log(Math.log(zn.abs()))/Math.log(2) This only works for mandelbrot, if you want to compute a smooth function for julia … Read more
I’m not clear why you can’t use the product of the bounds and do for x in range(y exp n) where n is the # of loops…. You say y exp n will be huge, but I’m sure python can handle it. However, that being said, what about some sort of recursive algorithm? def loop_rec(y, … Read more
First take a look at this related QA: Mandelbrot Set – Color Spectrum Suggestions? The main idea is to use histogram to distribute the color gradients more effectively to used indexes instead of uniformly wasting many colors on unused indexes. Also it uses a specific visually pleasing gradient function: RGB values of visible spectrum Dynamic … Read more