Use version 3.0 of chessql to parse CQL statements.

[RogerMarsh]

Chessql version 2.1.3 provides parsing, and some evaluation, for CQL statements currently.

Evaluation of CQL statements for ChessTab will be moved to modules in the chesstab project.

A subset of CQL features are currently evaluated and this will not change under this issue.

[RogerMarsh]

The statement 'cql()ray(R b k p)' was the main example when verifying the ChessTab evaluator gives the same answer as CQL version 6.2 for ray statements. The evaluation takes far too long with the ChessTab evaluator, over 67000 seconds for 10 million games, compared with about 1650 seconds with CQL 6.2.

Restricting the squares that need examining in the statement 'cql()ray(Rc4 b k pf7)' reduces the ChessTab evaluation time to about 51 seconds, while the CQL 6.2 time is reduced to about 1300 seconds.

The https://github.com/RogerMarsh/chesstagcql repository tries a possible solution.

ChessTab evaluation will be limited to piece designators and their combination in {} and () constructs.