25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Engines]] * Maxima2'''
[[FILE:MaximumParaboloid.png|border|right|thumb| Maxima <ref>The graph of a 3D [https://en.wikipedia.org/wiki/Paraboloid paraboloid] given by f(x,y) = -(x²+y²)+4, Shown is the [https://en.wikipedia.org/wiki/Maxima_and_minima global maximum] of the surface, at (0,0,4), Selfmade with [https://en.wikipedia.org/wiki/MuPAD MuPad], [https://en.wikipedia.org/wiki/User:Sam_Derbyshire Sam Derbyshire], February 21, 2008, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]
'''Maxima2''',<br/>
an [[UCI]] compliant [[:Category:Open Source|open source chess engine]] by [[Erik van het Hof]] and [[Hermen Reitsma]], released under the [[Free Software Foundation#GPL|GPL license]].
Maxima2 is written in [[Cpp|C++]] as successor of [[BugChess NL|BugChess]] aka '''QueenMaxima'''. The code has been completely rewritten and modernized using new developments in computer chess from the last decade,with [[Bitboards|bitboards]], [[Late Move Reductions|LMR]], less [[Extensions|extensions]], more [[Pruning|pruning]], [[Tapered Eval|tapered evaluation]], and integrated self-matching test for [[Engine Testing|testing]] and [[Automated Tuning|tuning]] [[Evaluation|evaluation]] values as most notable changes <ref>[https://github.com/hof/qm2/blob/master/README.md qm2/README.md at master · hof/qm2 · GitHub]</ref>.
=Maxima ChangesFeatures=The most notable changes are <ref>==[[Board Representation]]==* [https://github.com/hof/qm2/blob/master/README.md qm2/README.md at master · hof/qm2 · GitHub[Bitboards]]</ref>* 64 bits architecture with [[Magic Bitboards|bitboards]] and ==[[Search]]==* [[Iterative Deepening]]* [[Aspiration Windows]]* [[Principal Variation Search]] ([[Fail-Soft]])* [[Transposition Table]]* [[Move Generation|move generationSelectivity]] with ** [[Magic BitboardsCheck Extensions|magic bitboardsSafe Check Extensions]]* Using * [[Late Move Reductions]]** [[Mate Distance Pruning]]** [[Null Move Pruning]]** [[Futility Pruning]]** [[Reverse Futility Pruning]] (LMRBeta Pruning) in the ** [[Quiescence Search|search]]* Less [[Extensions|extensionsMove Ordering]]** [[Hash Move]], more ** [[PruningInternal Iterative Deepening]]** [[MVV-LVA|pruningMVV/LVA]]* More efficient code.* [[Static Exchange Evaluation]]* Integrated self-matching test for * [[Engine Testing|testingKiller Heuristic]] and ** [[Automated Tuning|tuningHistory Heuristic]] ==[[Evaluation|evaluation]] values==* [[Tapered Eval|Tapered evaluation]]* Maxima is now an [[UCIMaterial]]* [[Material Hash Table]]* [[Piece-Square Tables]]* [[Bishop Pair]]* [[Mobility]]* [[Trapped Pieces]]* [[Outposts]]* [[King Safety]]* [[Pawn Structure]]* [[Passed Pawn|Passed Pawns]] engine
=See also=
