RE: computer-go: perfect play : a new fractal algorithm

["Cuijpers, P.J.L." <P.J.L.Cuijpers@xxxxxx>]

My feeling tells me that time-dilatation is not the only problem you will
arrive at. Still it is an interesting concept and if I find the time I want
to give the idea some Deep-thought. However, I guess that if there is no
fundamental basis for the reduction-algorithm, then there is no sound output
either.

By the way,
I may have found a way to visualize the state-space of go using some
specification language like process algebra and a visualisation technique by
F.J.J. van Ham which he presents in his masters thesis "Visualisation of
State Transition Graphs" performed at the computer science department of the
"Technische Universiteit Eindhoven". Regrettably I do not have a copy
available, and no time to do it myself right now...

> -----Original Message-----
> From: Serge Boisse [mailto:boisse@xxxxxxxxxxxxxxxxx]
> Sent: vrijdag 29 september 2000 9:59
> To: computer go
> Subject: computer-go: perfect play : a new fractal algorithm
> 
> 
> Since cute and intelligent algorithms for computer go tend to 
> be very rare ;-),
> may I Propose you a new one ? You'll see that it is definitly 
> completly
> different from anything else.
> 
> And it might be the algorithm God uses to build our universe, 
> which as everybody
> knows ;-) is nothing but a gigantic go game God is playing 
> with himself...
> 
> I call this algorithm "fractal go".
> 
> It's an idea I had three years ago, but I lacked time to get 
> a full working
> program for it (I only wrote parts, but not a complete 
> program). I kept it a
> secret until now, in the hope I could one day win a lot of 
> money with it, but
> now I realise that sharing ideas is better for everybody, 
> including me !
> 
> I'm confident that some of you will find the idea interesting 
> AND workable, and
> will write code for it. If you do so, let me know it !
> 
> Since the description of the algorithm is a bit long, I will 
> not include it in
> this post, but rather the algorithm is described in a webpage 
> of mine at
>  http://www.multimania.com/boisse/fractalGo.html
> 
> I would very like you to look at this page and react in this 
> list. Just to let
> you figure out what my algo is able to, let me just say that 
> it can reduce the
> branching factor from 150 (on average) to just 4 ! An best of 
> all, the algo fits
> the programm with a "sense" of global strategy that currently 
> only human have.
> 
> -----claim-----------------------------------------------------
> My idea, "fractal go", described in the avove linked web 
> page, will be public
> from now on ("now" meaning the date of this posting, 
> September 29, 2000), so
> that you can use it freely without giving me any reward or 
> money, with the only
> two following restrictions :
> 1) Should you use this idea in your code, please include the 
> comment "this code
> uses the idea of fractal go by Serge Boisse" in your source code.
> 2) You are not allowed to ask for a patent for any algorithm 
> based onto this
> idea.
> By the way, I will not ask for a patent, too, since I'm 
> against the very idea of
> patenting algorithms and ideas.
> 
> -- 
>                     ____________ 
>                    / Linux now !\     ("`-/")_.-'"``-._    _
>           ,,,    O \____________/   o  @ @ `; -._    )-;-,_))
>          /'^'\ o°    / catch it ?\O°  (v_,)'  _  )`-.\  `---'
>         ( O O )      \___________/  __.- _..-_/ / ((.'
>  +---oOOo-(_)-oOOo-----------------((,.-'---((,/---------+
>  |  Serge Boisse                                         |
>  |  SERVICE TECHNIQUE DE LA NAVIGATION AERIENNE (STNA)   |
>  |  ODS FRANCE project, http://www.stna.dgac.fr/phidias  |
>  |  tel: (0)562 14 5731      mailto:boisse@xxxxxxxxxxxxxxxxx  |
>  |  homepages: http://www.multimania.com/boisse          |
>  |  and:       http://www.multimania.com/unitedplanet    |
>  +-----------Oooo----------------------------------------+ 
>      oooO   (   )
>      (   )   ) /
>       \ (   (_/
>        \_)
>