2009/11/14 Remco Gerlich <[email protected]>
> On Sat, Nov 14, 2009 at 6:05 PM, Michal Rudolf <[email protected]>wrote:
>
>> I didn't asked for a PGN that Scid can parse. I asked how you want that
>> PGN to
>> look - as I couldn't imagine how do you want to attach a variation without
>> main line move.
>>
>
> Let's say 1.e4 has been played, and 1...d5 is just a variation so far:
>
> [White "?"]
> [Black "?"]
> [Result "*"]
>
> 1.e4 ( 1...d5 ) *
>
Here is the PGN grammar :
<movetext-section> ::= <element-sequence> <game-termination>
<element-sequence> ::= <element> <element-sequence>
<recursive-variation> <element-sequence>
<empty>
<element> ::= <move-number-indication>
<SAN-move>
<numeric-annotation-glyph>
<recursive-variation> ::= ( <element-sequence> )
1.e4 ( 1...d5 ) *
does not comply to it as 1...d5 is not a <recursive-variation> but an
<element> (d5 is the variation of nothing).
See the definition of a RAV :
"An RAV (Recursive Annotation Variation) is a sequence of movetext
containing
one or more moves enclosed in parentheses. An RAV is used to represent an
alternative variation. The alternate move sequence given by an RAV is one
that
may be legally played by first unplaying the move that appears immediately
prior to the RAV. Because the RAV is a recursive construct, it may be
nested."
As you can't play d5 without e4, "1.e4 ( 1...d5 ) * " does not comply to
PGN.
Pascal
------------------------------------------------------------------------------
Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day
trial. Simplify your report design, integration and deployment - and focus on
what you do best, core application coding. Discover what's new with
Crystal Reports now. http://p.sf.net/sfu/bobj-july
_______________________________________________
Scid-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/scid-users
