Re: Accelerating the Buddhabrot with the Metropolis-Hastings algorithm

Hi again.

I found a bit of time yesterday, and inpired by your comments here I
tryed to use a kind of genetic algorithm to find best samples. I indeed
get something better than uniform sampling, but my images look ugly,
and quite biased.

I gonna try the Metropolis technique when I have a bit more time. For
those interested I found this paper about it

http://graphics.stanford.edu/courses/cs348b-03/lectures/metrofinal.pdf#search=%22%22Metropolis%20sampling%22%20%22

that seems to make lot of sense with what I see in Steckles's (Alex's)
code. I have a question however: why do you use a exp/log
transformation to calculate the aceptance function? Is is because the
values on the fraction are very big and log()-ing and exp()-ing fixes
it? Thx.

Again, this all is so interesting :)

Inigo

.