Pascal Georges, poniedziałek, 14 lipca 2008:
>What you describe here is pretty close to what is currently done by the code
>I wrote. If you look at comments (not necessarily code) of procedure
>markExercise, you will see the logic is pretty the same. But there is still
>a problem with depth limit
2008/7/13 Michal Rudolf <[EMAIL PROTECTED]>:
> Pascal Georges, niedziela, 13 lipca 2008:
>
> >Could you detail the algorithm to get the cases where :
> >- the opponent did not blunder
> >- there is some significant move to find
> >- the position is not already scored clearly for one side (already
Pascal Georges, niedziela, 13 lipca 2008:
>Could you detail the algorithm to get the cases where :
>- the opponent did not blunder
>- there is some significant move to find
>- the position is not already scored clearly for one side (already won game)
Sure, here is simple version:
Analyze positio
2008/7/13 Michal Rudolf <[EMAIL PROTECTED]>:
> Pascal Georges, niedziela, 13 lipca 2008:
>
> >> I am not sure I understand. So, in the second case tacitcs will be
> >> ignored?
> >Yes.
> Isn't it possible to still add it? It seems a waste of resources to miss
> such
> tactics - are there any rea
Pascal Georges, niedziela, 13 lipca 2008:
>> I am not sure I understand. So, in the second case tacitcs will be
>> ignored?
>Yes.
Isn't it possible to still add it? It seems a waste of resources to miss such
tactics - are there any reasons for skipping it?
--
Michal Rudolf
--
2008/7/13 Michal Rudolf <[EMAIL PROTECTED]>:
> Pascal Georges, niedziela, 13 lipca 2008:
>
> >> So, this won't find tactics which actually happened in the game and
> >> without blunder on opponents part?
> >Yes, and it is the only interesting case. If there is a winning move,
> either
> >
> >- a
On Jul 13, 2008, at 7:19 AM, Pascal Georges wrote:
> Hi,
>
> Someone reported a small problem compiling Phalanx with Debian Linux
> 4.0r3.
>--
>.o/data.o: In function `initdist':
>data.c:(.text+0x46): undefined reference to `taxi_dist'
>data.c:(.text+
Hi,
What is the licence of the speak program?
Its mentioned in the program that it belongs to the crafty program.
Is it GPL-v2? If not, then we have to patch the driver so it will not call
speak.
greatings,
Willem
--
This message has been scanned for viruses and
dangerous content by MailScann
Pascal Georges, niedziela, 13 lipca 2008:
>> So, this won't find tactics which actually happened in the game and
>> without blunder on opponents part?
>Yes, and it is the only interesting case. If there is a winning move, either
>
>- a blunder was made;
>- the position drifted to a lost one, whic
2008/7/13 Michal Rudolf <[EMAIL PROTECTED]>:
>
> >> One more question: what does it mean: from 1.91 to 4.38?
> >The opponent (black here) should have played a move with a score of 1.91,
> >but he played something at 4.38, hence the expected move to find for white
> >should be at this latest value
Pascal Georges, niedziela, 13 lipca 2008:
>> I am not sure how tactical exercise was determined, but I wouldn't mark
>> anything clearly losing (let's say <-1) as tactical exercise. As I wrote
>> before, probably only moves leading to serious advantage give reasonable
>> quality.
>There is only o
Hi,
Someone reported a small problem compiling Phalanx with Debian Linux 4.0r3.
--
.o/data.o: In function `initdist':
data.c:(.text+0x46): undefined reference to `taxi_dist'
data.c:(.text+0x7f): undefined reference to `diag_dist'
data.c:(.text+0xb8): unde
2008/7/12 Michal Rudolf <[EMAIL PROTECTED]>:
> Pascal Georges, sobota, 12 lipca 2008:
> >I switched to "from/to" in CVS. So don't use previous code (with sc/psc),
> or
> >"Find best move" will not find next tactical position.
>
> Look at following game:
> 1. e4 c5 2. c3 d5 3. exd5 Qxd5 4. d4 Nc6
13 matches
Mail list logo
