Difference between revisions of "Ulysses"

From Chessprogramming wiki
Jump to: navigation, search
 
(4 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
'''Ulysses''',<br/>
 
'''Ulysses''',<br/>
a chess program by [[Ulf Lorenz]] and [[Valentin Rottmann]]. Ulysses used the unique approach of [[Controlled Conspiracy Number Search]], developed and implemented by Ulf and Valentin within the research group of [[Burkhard Monien]] from the [[Paderborn University]]. Ulysses played the [[WCCC 1992]] in [https://en.wikipedia.org/wiki/Madrid Madrid], the [[WMCCC 1993]] in [https://en.wikipedia.org/wiki/Munich Munich] and the [[WCCC 1995]] in [https://en.wikipedia.org/wiki/Hong_Kong Hong Kong] as well the four early [[IPCCC|IPCCCs]] from 1991 until 1994, and was superseded by its successor [[P.ConNerS]] performing [[Parallel Controlled Conspiracy Number Search]] <ref> [[Ulf Lorenz]], [[Valentin Rottmann]] ('''1996'''). ''Parallel Controlled Conspiracy-Number Search''. [[Advances in Computer Chess 8]]</ref>.  
+
a chess program by [[Ulf Lorenz]] and [[Valentin Rottmann]]. Ulysses used the unique approach of [[Conspiracy Number Search#CCNS|Controlled Conspiracy Number Search]], developed and implemented by Ulf and Valentin within the research group of [[Burkhard Monien]] from the [[Paderborn University]]. Ulysses played the [[WCCC 1992]] in [https://en.wikipedia.org/wiki/Madrid Madrid], the [[WMCCC 1993]] in [https://en.wikipedia.org/wiki/Munich Munich] and the [[WCCC 1995]] in [https://en.wikipedia.org/wiki/Hong_Kong Hong Kong] as well the four early [[IPCCC|IPCCCs]] from 1991 until 1994, and was superseded by its successor [[P.ConNerS]] performing [[Conspiracy Number Search#PCCNS|Parallel Controlled Conspiracy Number Search]] <ref> [[Ulf Lorenz]], [[Valentin Rottmann]] ('''1996'''). ''Parallel Controlled Conspiracy-Number Search''. [[Advances in Computer Chess 8]]</ref>.  
  
 
=Description=  
 
=Description=  
 
given in 1995 from the [[ICGA]]-site <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=192 Ulysses' ICGA Tournaments]</ref>:
 
given in 1995 from the [[ICGA]]-site <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=192 Ulysses' ICGA Tournaments]</ref>:
  [https://en.wikipedia.org/wiki/Odysseus Ulysses] was the legendary conqueror of [https://en.wikipedia.org/wiki/Troy Troy] and on his adventurous journey home to Athens he made many wanderings. The program 'UlyssesCCN' is written in [[C]] and uses a new searching technique called '[[Controlled Conspiracy Number Search]]' (CCNS). The CCNS algorithm has been developed by Lorenz and Rottmann in their master thesis. CCNS takes up the [[Conspiracy Numbers|Conspiracy Number]] scheme which was published by [[David McAllester|McAllester]] in 1988.
+
  [https://en.wikipedia.org/wiki/Odysseus Ulysses] was the legendary conqueror of [https://en.wikipedia.org/wiki/Troy Troy] and on his adventurous journey home to Athens he made many wanderings. The program 'UlyssesCCN' is written in [[C]] and uses a new searching technique called '[[Conspiracy Number Search#CCNS|Controlled Conspiracy Number Search]]' (CCNS). The CCNS algorithm has been developed by Lorenz and Rottmann in their master thesis. CCNS takes up the [[Conspiracy Numbers|Conspiracy Number]] scheme which was published by [[David McAllester|McAllester]] in 1988.
  
 
  This scheme makes it possible to achieve selectivity in the plain search algorithm without any domain dependent (i.e. chess specific) knowledge. The search tree has to be kept in memory (at least implicitly). Conspiracy Numbers were further investigated by [[Jonathan Schaeffer|Schaeffer]] in 1989. He has implemented a [[Conspiracy Number Search]] (CNS) in his program 'Conspire', which showed good tactical performance but unfortunately not good positional play. In developing the CCNS we explicitly used, for the first time, the observed locality of other CNS algorithms. In the evaluation of [[Leaf Node|leaf-nodes]] a CCNS algorithm is able to use [[Quiescence Search|quiescence searches]] with initial windows. Positional play becomes possible. UlyssesCNN also uses a hash table which recognizes transpositions. Last, but not least, only a best move is computed and no resources are wasted for computing an upper bound for the value of this move. All chess specific knowledge used is encoded in the [[Evaluation|evaluation]] function. This consists of a static evaluator and a small quiescence search. Using a [[SPARCstation|Sparc 10]] 60MHz, UlyssesCCN searches about 8000 nodes per second, about 350 of them are Conspiracy Number nodes. The opening book consists of 11,000 positions. After 300 seconds at each position, Ulysses solves 281 positions of [[Win at Chess|WinAtChess]] test set, consisting of 300 positions. To our knowledge, UlyssesCCN is the first chess program based on Conspiracy Numbers which achieved an acceptable result in a computer chess tournament.  
 
  This scheme makes it possible to achieve selectivity in the plain search algorithm without any domain dependent (i.e. chess specific) knowledge. The search tree has to be kept in memory (at least implicitly). Conspiracy Numbers were further investigated by [[Jonathan Schaeffer|Schaeffer]] in 1989. He has implemented a [[Conspiracy Number Search]] (CNS) in his program 'Conspire', which showed good tactical performance but unfortunately not good positional play. In developing the CCNS we explicitly used, for the first time, the observed locality of other CNS algorithms. In the evaluation of [[Leaf Node|leaf-nodes]] a CCNS algorithm is able to use [[Quiescence Search|quiescence searches]] with initial windows. Positional play becomes possible. UlyssesCNN also uses a hash table which recognizes transpositions. Last, but not least, only a best move is computed and no resources are wasted for computing an upper bound for the value of this move. All chess specific knowledge used is encoded in the [[Evaluation|evaluation]] function. This consists of a static evaluator and a small quiescence search. Using a [[SPARCstation|Sparc 10]] 60MHz, UlyssesCCN searches about 8000 nodes per second, about 350 of them are Conspiracy Number nodes. The opening book consists of 11,000 positions. After 300 seconds at each position, Ulysses solves 281 positions of [[Win at Chess|WinAtChess]] test set, consisting of 300 positions. To our knowledge, UlyssesCCN is the first chess program based on Conspiracy Numbers which achieved an acceptable result in a computer chess tournament.  
Line 30: Line 30:
 
* [https://en.wikipedia.org/wiki/Ulysses_%28novel%29 Ulysses (novel) from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Ulysses_%28novel%29 Ulysses (novel) from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Ulysses_%28spacecraft%29 Ulysses (spacecraft) from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Ulysses_%28spacecraft%29 Ulysses (spacecraft) from Wikipedia]
* [[:Category:Cream|Cream]] - [https://en.wikipedia.org/wiki/Tales_of_Brave_Ulysses Tales Of Brave Ulysses], [https://en.wikipedia.org/wiki/Live_Cream_Volume_II Live Cream Volume II], March 10, 1968 at [https://en.wikipedia.org/wiki/Winterland_Ballroom Winterland], [https://en.wikipedia.org/wiki/San_Francisco San Francisco] <ref>[https://tomcaswell.net/2015/02/25/bootleg-series-12-cream-live-at-winterland-san-francisco-ca-10th-march-1968/ Bootleg Series #12: Cream – Winterland, San Francisco, CA. 10th March 1968] by [https://tomcaswell.net/ Tom Caswell],  February 25, 2015</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* [[:Category:Cream|Cream]] - [https://en.wikipedia.org/wiki/Tales_of_Brave_Ulysses Tales of Brave Ulysses], [https://en.wikipedia.org/wiki/Live_Cream_Volume_II Live Cream Volume II], March 10, 1968 at [https://en.wikipedia.org/wiki/Winterland_Ballroom Winterland], [https://en.wikipedia.org/wiki/San_Francisco San Francisco] <ref>[https://tomcaswell.net/2015/02/25/bootleg-series-12-cream-live-at-winterland-san-francisco-ca-10th-march-1968/ Bootleg Series #12: Cream – Winterland, San Francisco, CA. 10th March 1968] by [https://tomcaswell.net/ Tom Caswell],  February 25, 2015</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=yN4Nd9ENGL0|alignment=left|valignment=top}}
+
: {{#evu:https://www.youtube.com/watch?v=BwJkY1KC9eM|alignment=left|valignment=top}}
  
 
=References=  
 
=References=  
 
<references />
 
<references />
 
'''[[Engines|Up one Level]]'''
 
'''[[Engines|Up one Level]]'''
 +
[[Category:SPARC]]
 +
[[Category:SPARCstation]]
 
[[Category:Mythology]]
 
[[Category:Mythology]]
 
[[Category:Cream]]
 
[[Category:Cream]]
 +
[[Category:Jack Bruce]]

Latest revision as of 13:23, 12 January 2020

Home * Engines * Ulysses

Ulysses [1]

Ulysses,
a chess program by Ulf Lorenz and Valentin Rottmann. Ulysses used the unique approach of Controlled Conspiracy Number Search, developed and implemented by Ulf and Valentin within the research group of Burkhard Monien from the Paderborn University. Ulysses played the WCCC 1992 in Madrid, the WMCCC 1993 in Munich and the WCCC 1995 in Hong Kong as well the four early IPCCCs from 1991 until 1994, and was superseded by its successor P.ConNerS performing Parallel Controlled Conspiracy Number Search [2].

Description

given in 1995 from the ICGA-site [3]:

Ulysses was the legendary conqueror of Troy and on his adventurous journey home to Athens he made many wanderings. The program 'UlyssesCCN' is written in C and uses a new searching technique called 'Controlled Conspiracy Number Search' (CCNS). The CCNS algorithm has been developed by Lorenz and Rottmann in their master thesis. CCNS takes up the Conspiracy Number scheme which was published by McAllester in 1988.
This scheme makes it possible to achieve selectivity in the plain search algorithm without any domain dependent (i.e. chess specific) knowledge. The search tree has to be kept in memory (at least implicitly). Conspiracy Numbers were further investigated by Schaeffer in 1989. He has implemented a Conspiracy Number Search (CNS) in his program 'Conspire', which showed good tactical performance but unfortunately not good positional play. In developing the CCNS we explicitly used, for the first time, the observed locality of other CNS algorithms. In the evaluation of leaf-nodes a CCNS algorithm is able to use quiescence searches with initial windows. Positional play becomes possible. UlyssesCNN also uses a hash table which recognizes transpositions. Last, but not least, only a best move is computed and no resources are wasted for computing an upper bound for the value of this move. All chess specific knowledge used is encoded in the evaluation function. This consists of a static evaluator and a small quiescence search. Using a Sparc 10 60MHz, UlyssesCCN searches about 8000 nodes per second, about 350 of them are Conspiracy Number nodes. The opening book consists of 11,000 positions. After 300 seconds at each position, Ulysses solves 281 positions of WinAtChess test set, consisting of 300 positions. To our knowledge, UlyssesCCN is the first chess program based on Conspiracy Numbers which achieved an acceptable result in a computer chess tournament. 

See also

Publications

External Links

Chess Program

Ulysses

References

  1. Head of Odysseus from a sculptural group representing Odysseus blinding Polyphemus. Marble, Greek, probably 1st century AD. From the villa of Tiberius at Sperlonga, Museo Archeologico Nazionale in Sperlonga, Odysseus from Wikipedia
  2. Ulf Lorenz, Valentin Rottmann (1996). Parallel Controlled Conspiracy-Number Search. Advances in Computer Chess 8
  3. Ulysses' ICGA Tournaments
  4. Bootleg Series #12: Cream – Winterland, San Francisco, CA. 10th March 1968 by Tom Caswell, February 25, 2015

Up one Level