Draft:History heuristic
 | Draft article not currently submitted for review.
This is a draft Articles for creation (AfC) submission. It is not currently pending review. While there are no deadlines, abandoned drafts may be deleted after six months. To edit the draft click on the "Edit" tab at the top of the window. To be accepted, a draft should:
It is strongly discouraged to write about yourself, your business or employer. If you do so, you must declare it. Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Last edited by Graeme Bartlett (talk | contribs) 0 seconds ago. (Update) |
In computer chess and other games, the history heuristic is a statistical estimate of a move's strength. In other words, it measures the likelihood of a given move to produce a beta-cutoff. The history heuristic is originally used to improve move ordering, but has since been used to improve many other search heuristics. [1]
Origin
[edit]References
[edit]- ^ The History Heuristic and Alpha-Beta Search Enhancements in Practice, Jonathan Schaeffer