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 et al. [1] within the research group of Burkhard Monien from the University of Paderborn, Germany. Heiner Matthias was responsible for the book moves.

Descriptions

ICGA

from the ICGA-site [2]:
P.ConNerS stands for 'Parallel Controlled Conspiracy Number Search'. It has been written by Ulf Lorenz, who is a member of Prof. Dr. Burkhard Monien's research group at the University of Paderborn. U. Lorenz mainly works on the research fields of domain independent selective search in game trees, and on the field of efficient parallel algorithms for optimization problems. P.ConNerS uses a variant of the so called 'Controlled Conspiracy Number Search' algorithm. As a result it examines highly selective and irregular game trees. Evaluations are done by the help of depth 2 alphabeta searches. When it runs on a parallel machine with 60 Pentium 300 MHz processors, P.ConNerS reaches a rate of about 1.2 million nodes per second.

P.ConNerS

from the P.ConNerS site, after winning the 10th Grandmaster Tournament in Lippstadt, July 2000 [3]
P.ConNerS stands for 'Parallel Controlled Conspiracy Number Search'. Thus, the tournament victory is highly interesting from a research perspective, as well: P.ConNerS uses a non-conventional, non-alphabeta search algorithm. The search algorithm tries not only to maximize the search depth, but also tries to guarantee that even when one leaf-value changes, the result stays the same. A conspiracy 2 search may be interpreted as a special, global arrangement of a lot of so called singular extensions. As a result, it domain-independently searches highly selective and irregular game trees. The program is written in C.

P.ConNerS runs in parallel and gets its playing strength out of a workstation cluster, which consists of 160 Pentium II, 450 Mhz processors. Those are connected with a new European interconnection network, the so called SCI network. On that machine P.ConNerS examines between 3.5 and 5.0 Mnds/sec. On the 160 processors it achieves a speedup of about 50.

Achievements


Selected Games

10th Grandmaster Tournament, Lippstadt, P.ConNerS - Maia Chiburdanidze [5]
[Event "Lippstadt 10th"]
[Site "Lippstadt"]
[Date "2000.07.06"]
[Round "2"]
[White "P.ConNers"]
[Black "Maia Chiburdanidze"]
[Result "1-0"]
 
1.c4 e5 2.Nc3 Bb4 3.Nd5 Be7 4.d4 d6 5.e4 Nc6 6.dxe5 dxe5 7.Nf3 Bg4 8.Be2 Nf6 
9.O-O O-O 10.Nxe5 Nxe5 11.Nxf6+ Bxf6 12.Bxg4 Qxd1 13.Bxd1 Nxc4 14.Be2 Na3 
15.Bf4 Bxb2 16.Rad1 c6 17.Rd2 Bc3 18.Rd7 Rfe8 19.Bc1 Nb5 20.Bc4 Rxe4 21.Bxf7+ 
Kh8 22.Rfd1 Bf6 23.Rxb7 Nd6 24.Rd7 Nxf7 25.Rxf7 Ra4 26.a3 c5 27.Rdd7 Kg8 28.Kf1 
a6 29.Bg5 Ba1 30.Be3 Rc8 31.Bc1 Rc4 32.Be3 Rc2 33.Rf5 c4 34.Ra5 Rc6 35.Ra7 Rd6 
36.g3 Rd1+ 37.Kg2 Bf6 38.R5xa6 c3 39.a4 Re2 40.Rc6 h5 41.a5 Ra2 42.a6 Rda1 
43.Ra8+ Kh7 44.a7 Kg6 45.Kf3 Ra4 46.h3 Kh7 47.g4 hxg4+ 48.hxg4 Bd4 49.Bxd4 Rxd4
50.g5 Rda4 51.Rh8+ 1-0

See also


Publications


Forum Posts


External Links


References

  1. ^ U. Lorenz and V. Rottmann (1996). Parallel Controlled Conspiracy-Number Search. - Advances in Computer Chess 8
  2. ^ P.ConNerS' ICGA Tournaments
  3. ^ P.ConNerS site
  4. ^ Computer P.ConNers gewinnt 10. Lippstädter GM Turnier
  5. ^ ConNers (Computer) vs Maia Chiburdanidze (2000) from chessgames.com

What links here?


Up one Level