Edax (computing): Difference between revisions
Content deleted Content added
m Reverted edits by Abhi977 (talk): addition of unnecessary/inappropriate external links (HG) (3.4.12) |
m Removed wording that may make article sound like an advertisement |
||
| Line 3: | Line 3: | ||
{{advertising|date=August 2021}} |
{{advertising|date=August 2021}} |
||
}} |
}} |
||
'''Edax''' is an [[Computer Othello|Othello-playing]] computer game, capable of playing the game at |
'''Edax''' is an [[Computer Othello|Othello-playing]] [[PC game|computer game]], capable of playing the game at difficult levels, similar to how others computer games are chess-playing computer games. Edax was [[Programmer|written]] by Richard Delorme in 1998. |
||
Edax utilizes various [[algorithms]]. Notably among them are: [[bitboard]] move generator, [[negascout]] [[tree search]], multi-probcut selective search,<ref name="Buro" /> parallel search using the ''Young Brother Wait'' concept,<ref>{{Cite web |url=http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.ps.Z |title=R. Feldmann, Game Tree Search on Massively Parallel Systems, 1993 |access-date=2009-11-02 |archive-url=https://web.archive.org/web/20070612141107/http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.ps.Z |archive-date=2007-06-12 |url-status=dead }}</ref> and pattern based evaluation function.<ref name="Buro">Buro, M., [http://www.cs.ualberta.ca/~mburo/ps/improve.pdf "Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello"], ''Games in AI Research'', H.J. van den Herik, H. Iida (ed.), {{ISBN|90-621-6416-1}}, 2000</ref> |
|||
== References == |
|||
{{Reflist}} |
References{{Reflist}} |
||
== External links == |
== External links == |
||
Revision as of 16:41, 12 May 2023
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Edax is an Othello-playing computer game, capable of playing the game at difficult levels, similar to how others computer games are chess-playing computer games. Edax was written by Richard Delorme in 1998.
Edax utilizes various algorithms. Notably among them are: bitboard move generator, negascout tree search, multi-probcut selective search,[1] parallel search using the Young Brother Wait concept,[2] and pattern based evaluation function.[1]
References
- ^ a b Buro, M., "Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello", Games in AI Research, H.J. van den Herik, H. Iida (ed.), ISBN 90-621-6416-1, 2000
- ^ "R. Feldmann, Game Tree Search on Massively Parallel Systems, 1993". Archived from the original on 2007-06-12. Retrieved 2009-11-02.
External links
 | This digital board game-related article is a stub. You can help Wikipedia by expanding it. |