This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Onno

Home * Engines * Onno

Onno logo 1Onno logo 1


  1. Onno Chess Software↩︎

Onno,
was a commercial chess engine developed by Onno Garms, written in C++ and released in May 2009. After announcing the end of Onno's development in March 2011 1, Onno Garms revealed several ideas that made Onno stronger. The 32/64-bit Windows or 64-bit Linux executables communicate with a chess GUI via UCI.

Contents
  1. Description
    1. Basics
    2. Search
      1. Parallel Search
      2. Node Types
  2. See also
  3. Forum Posts
    1. 2009
    2. 2010
    3. 2011 ...
  4. External Links
    1. Chess Engine
    2. Misc
  5. References

Description

Basics

Onno uses a fixed shift variation of Magic bitboards 2 to determine sliding piece attacks. Its static exchange evaluation considers alpha and beta 3. Evaluation features were tuned automaticly performing a Genetic algorithm 4.

Onno applies an iterative search along with PVS, null move pruning and verification search. Onno further uses a technique dubbed bad pruning similar to razoring. The idea is to apply a reduced search with a reduced window - if the search at depth d-3 says that one loses more then a pawn, it does not search the move with the current depth d 5.

The MP version of Onno searches in parallel utilizing YBWC by following Rainer Feldmann's 1993 Ph.D. thesis Game Tree Search on Massively Parallel Systems 6 using virtual messaging.

Node Types

Onno determines expected Node Types to perform IID not only at PV-nodes but also at expected Cut-nodes. Onno Garms gave following rules 7

See also

Forum Posts

2009

2010

2011 ...

Chess Engine

Misc

References

Up one level


  1. Development of Onno ends by Onno Garms, CCC, March 13, 2011↩︎

  2. Magic with fixed shift by Onno Garms, Winboard Forum, March 18, 2009↩︎

  3. SEE with alpha beta by Onno Garms, CCC, August 14, 2011↩︎

  4. Parameter tuning by Onno Garms, CCC, March 13, 2011↩︎

  5. Bad Pruning by Onno Garms, CCC, March 13, 2011↩︎

  6. Rainer Feldmann (1993). Game Tree Search on Massively Parallel Systems. Ph.D. thesis↩︎

  7. Re: On internal iterative deeping by Onno Garms, CCC, March 17, 2011↩︎

Categories: Commercial · UCI · Given Name

What links here

Contributors: GerdIsenberg.