No, you are not stupid. I have not yet written the CGI scripts
to allow downloads. So there is no easy way (yet) to get them.
I'll try to get to this soon.
- Don
On Wed, 2007-04-25 at 17:23 +0200, Christian Nilsson wrote:
> I've been trying to download the complete set of games from the
On 4/25/07, Remi Munos <[EMAIL PROTECTED]> wrote:
> When I did sit down and read the paper for real, I saw that both of
those
> things were just building up the support for the BAST algorithm. (a) is
to
> justify accepting a higher regret (in exchange for better worst case
> performance).
well
Le Mercredi 25 Avril 2007 15:49, vous avez écrit :
> On 4/25/07, Remi Munos <[EMAIL PROTECTED]> wrote:
> > > 3. The goal is to find the optimal leaf rather than the optimal
> > > subtree.
> >
> > I'm not sure to understand this comment. Actually the goal is to find a
> > close-to optimal play at th
I've been trying to download the complete set of games from the new
CGOS, but can't seem to find a suitable URL for the job. I tried all
kinds of modifications of the URLs from the old system, but none
worked. Are the games still available for batch downloads, or do I
really have to fetch them one
On 4/25/07, Remi Munos <[EMAIL PROTECTED]> wrote:
> 3. The goal is to find the optimal leaf rather than the optimal subtree.
I'm not sure to understand this comment. Actually the goal is to find a
close-to optimal play at the root level. Thus finding a close-to-optimal
min-max leaf achieves tha
Hi
> I haven't gotten to read through your paper as carefully as I'd like yet,
> but I do have a few observations that may be of benefit to other readers on
> the list... Mostly observation of assumptions used in the paper.
>
> 1. A max tree is used instead of minimax
Yes. For min-max trees, seve
