Difference between revisions of "Amoeba"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Engines * Amoeba''' [[FILE:Nelder-Mead Simionescu.gif|border|right|thumb|[https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method Amoeba search]...")
 
Line 4: Line 4:
  
 
'''Amoeba''',<br/>
 
'''Amoeba''',<br/>
an [[UCI]] compliant [[:Category:Open Source|open source chess engine]] by [[Richard Delorme]], written in the [[D-Proglanguage|D programming language]], first released in May 2016 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=60228 amoeba a new UCI engine] by [[Richard Delorme]], [[CCC]], May 20, 2016</ref>, licensed under the [[Free Software Foundation#GPL|GPL v3.0]]. Amoeba uses the [https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method Nelder–Mead method] <ref>[https://en.wikipedia.org/wiki/John_Nelder John Nelder], [https://de.wikipedia.org/wiki/Roger_Mead Roger Mead] ('''1965'''). ''A Simplex Method for Function Minimization''. [https://en.wikipedia.org/wiki/The_Computer_Journal The Computer Journal], Vol. 7, No. 4, doi:[http://comjnl.oxfordjournals.org/content/7/4/308 10.1093/comjnl/7.4.308]</ref> or downhill simplex method <ref>[[Mathematician#MHWright|Margaret H. Wright]] ('''2012'''). ''Nelder, Mead, and the Other Simplex Method''. [https://www.math.uni-bielefeld.de/documenta/Welcome-eng.html Documenta Mathematica], [https://www.math.uni-bielefeld.de/documenta/vol-ismp/vol-ismp.html Extra Volume Optimization Stories], [http://www.math.uiuc.edu/documenta/vol-ismp/42_wright-margaret.pdf pdf]</ref> to [[Automated Tuning|tune]] its [[Evaluation|evaluation]] parameters, also called '''amoeba''' method and eponym of the program <ref>[https://github.com/abulmo/amoeba/blob/master/README.md amoeba/README.md at master · abulmo/amoeba · GitHub]</ref>.  
+
an [[UCI]] compliant [[:Category:Open Source|open source chess engine]] by [[Richard Delorme]], written in the [[D (Programming Language)|D programming language]], first released in May 2016 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=60228 amoeba a new UCI engine] by [[Richard Delorme]], [[CCC]], May 20, 2016</ref>, licensed under the [[Free Software Foundation#GPL|GPL v3.0]]. Amoeba uses the [https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method Nelder–Mead method] <ref>[https://en.wikipedia.org/wiki/John_Nelder John Nelder], [https://de.wikipedia.org/wiki/Roger_Mead Roger Mead] ('''1965'''). ''A Simplex Method for Function Minimization''. [https://en.wikipedia.org/wiki/The_Computer_Journal The Computer Journal], Vol. 7, No. 4, doi:[http://comjnl.oxfordjournals.org/content/7/4/308 10.1093/comjnl/7.4.308]</ref> or downhill simplex method <ref>[[Mathematician#MHWright|Margaret H. Wright]] ('''2012'''). ''Nelder, Mead, and the Other Simplex Method''. [https://www.math.uni-bielefeld.de/documenta/Welcome-eng.html Documenta Mathematica], [https://www.math.uni-bielefeld.de/documenta/vol-ismp/vol-ismp.html Extra Volume Optimization Stories], [http://www.math.uiuc.edu/documenta/vol-ismp/42_wright-margaret.pdf pdf]</ref> to [[Automated Tuning|tune]] its [[Evaluation|evaluation]] parameters, also called '''amoeba''' method and eponym of the program <ref>[https://github.com/abulmo/amoeba/blob/master/README.md amoeba/README.md at master · abulmo/amoeba · GitHub]</ref>.  
  
 
=Features=
 
=Features=
Line 35: Line 35:
 
* [[Automated Tuning]] using [https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method Nelder–Mead method] aka Amoeba method
 
* [[Automated Tuning]] using [https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method Nelder–Mead method] aka Amoeba method
 
==<span id="TournamentManager"></span>[[Match Statistics#TournamentManager|Tournament Manager]]==
 
==<span id="TournamentManager"></span>[[Match Statistics#TournamentManager|Tournament Manager]]==
: With the release of Amoeba '''2.1''', the code of a tournament manager was published also written in [[D-Proglanguage|D language]], used to validate or reject Amoeba changes <ref>[http://www.talkchess.com/forum/viewtopic.php?t=62922 sprt tourney manager] by [[Richard Delorme]], [[CCC]], January 24, 2017</ref>. So far only with fixed time per move, it  
+
: With the release of Amoeba '''2.1''', the code of a tournament manager was published also written in [[D (Programming Language)|D language]], used to validate or reject Amoeba changes <ref>[http://www.talkchess.com/forum/viewtopic.php?t=62922 sprt tourney manager] by [[Richard Delorme]], [[CCC]], January 24, 2017</ref>. So far only with fixed time per move, it  
 
* can use various [[Opening Book|openings]] from [[Portable Game Notation|pgn file]]
 
* can use various [[Opening Book|openings]] from [[Portable Game Notation|pgn file]]
 
* can play several games in parallel
 
* can play several games in parallel

Revision as of 15:36, 31 October 2018

Home * Engines * Amoeba

Amoeba,
an UCI compliant open source chess engine by Richard Delorme, written in the D programming language, first released in May 2016 [2], licensed under the GPL v3.0. Amoeba uses the Nelder–Mead method [3] or downhill simplex method [4] to tune its evaluation parameters, also called amoeba method and eponym of the program [5].

Features

[6]

Board Representation

Search

Evaluation

Tournament Manager

With the release of Amoeba 2.1, the code of a tournament manager was published also written in D language, used to validate or reject Amoeba changes [7]. So far only with fixed time per move, it

See also

Forum Posts

2016

2017

2018

External Links

Chess Engine

Misc

References

Up one Level