[computer-go] Amsterdam 2007 paper

[Magnus Persson]

Thanks, for sharing this early!

Everything in this paper makes perfect sense, and is well written. 
Reading it is
like finding the last pieces of a difficult puzzle.

I do however have some problem with the math of section "2.5 A
Minorization-Maximization Algorithm". I have a feeling that a lot of
definitions are left out here. What is A, B, M and N? I think I can get what N
is. Somehow I have a feeling that you are using some special notation of
summation here, but even so I have no clue what is summed.

Also for Wi you use {} and || which might mean something special, but 
since I am
already quite confused it hard to figure out.

Later on the section "Derivation of the Minorization-Maximization Formula"
seemed pretty clear to me although that was supposed to be more difficult.

Best
Magnus

Quoting Rémi Coulom <Remi.Coulom at univ-lille3.fr>:

> Hi,
>
> I first thought I would keep my ideas secret until the Asmterdam 
> tournament, but now that I have submitted my paper, I cannot wait to 
> share it. So, here it is:
>
> http://remi.coulom.free.fr/Amsterdam2007/
>
> Comments and questions are very welcome.