P.ConNerS
Home *
Engines * P.ConNerS
P.ConNerS,
a parallel chess program by
Ulf Lorenz. P.ConNerS used the unique approach of
Parallel Controlled Conspiracy Number Search, developed by Ulf Lorenz and
Valentin Rottmann [1] within the research group of
Burkhard Monien from the
Paderborn University.
Heiner Matthias was responsible for the
book moves.
ICGA#
from the
ICGA tournament site [2]:
P.ConNerS#
from the P.ConNerS site, after winning the 10th Grandmaster Tournament in
Lippstadt, July 2000 [3]
Achievements#
Selected Games#
10th Grandmaster Tournament,
Lippstadt, P.ConNerS -
Maia Chiburdanidze [5]
See also#
Publications#
Forum Posts#
1998 …#
- Is there really any good alternative to alfa-beta search? by
Jouni Uski,
CCC, June 09, 1998
- WCCC 99 LambChop - P. ConNerS “1 - 0” Round 1 by Jose Hernandez,
CCC, June 14, 1999 »
LambChop,
WCCC 1999
- What went wrong with P.Conners and Zugzwang in WCCC? by
Jouni Uski,
CCC, June 29, 1999 »
WCCC 1999
2000 …#
- P.Conners is leading with 4 out of 5 by
Uri Blass,
CCC, July 10, 2000
- About PConners by
Jouni Uski,
CCC, July 25, 2000
- Test Position, Rook and Pawn Ending, Yace- P.ConNerS (0-1) by
Ferdinand Mosca,
CCC, February 22, 2001
External Links#
References#
- ↑
Ulf Lorenz,
Valentin Rottmann (1996). Parallel Controlled Conspiracy-Number Search.
Advances in Computer Chess 8
- ↑
P.ConNerS’ ICGA Tournaments
- ↑
The chess program P.ConNerS
- ↑
Computer P.ConNers gewinnt 10. Lippstädter GM Turnier
- ↑
ConNers (Computer) vs Maia Chiburdanidze (2000) from
chessgames.com
Up one Level