Talk:Endgame tablebase
From Wikipedia, the free encyclopedia
 |
This article is a current featured article candidate. A featured article should exemplify Wikipedia's very best work, and is therefore expected to meet several criteria. Please feel free to |
| When the FAC director promotes or archives the nomination, a bot will update the article talk page. | |
 |
Endgame tablebase was a good article candidate, but did not meet the good article criteria at the time. Once the objections listed below are addressed, the article can be renominated. You may also seek a review of the decision if you feel there was a mistake.
Date of review: 2007-02-24 |
 |
This page is part of a WikiProject to improve Wikipedia's articles related to chess. Please participate by editing this article or portal or visiting the project page or its discussion page. |
Contents |
[edit] A note to reviewers from the Good Article committee
Although many users have contributed to this article, I am responsible for most of its content, and I am probably the most expert Wikipedian on this subject. I would like to anticipate 3 issues you might have with this article.
- Insufficient context. I've tried to avoid this, but inevitably, in an arcane topic such as this, there will be parts you don't fully understand. Please point them out.
- Missing references. Every statement I've made in the article comes from somewhere; I just haven't put in all the references because I was writing somewhat off-the-cuff. If you put "citation needed" tags in some places, I should be able to find the citations.
- Inconsistent style of referencing. I simply don't know how to do this correctly. A little guidance might be helpful.
When you've reviewed this article, please let me know on my talk page. Best regards, YechielMan 06:09, 11 February 2007 (UTC)
[edit] six-piece tablebase complete?
From what I understand, the six-piece tablebases are not complete yet. Can anyone verify that? Bubba73 (talk), 18:06, 16 June 2006 (UTC)
There are complete since quite some time, but not completely available for the public. --Enlil2 09:13, 2 August 2006 (UTC)
- thank you. Someone (maybe you) put in that they are 1.2 terabytes in size. Bubba73 (talk), 14:42, 2 August 2006 (UTC)
- They are complete. However, 5 vs. 1 are not complete bec. they are not needed, but some folks on the CCRL forum want to construct them anyway. In special cases like KNNNNK this makes some sense, but even then, KNNNK is generally a win. YechielMan 04:20, 6 February 2007 (UTC)
[edit] Image doesn't match text
The text gives a 262 move mate quoting a KRBKNN ending, but the diagram is KRNKNN. As I don't know which is correct I'll leave it to someone else to edit or change the diagram. ScottRShannon 01:49, 27 September 2006 (UTC)
- It's been fixed already. The KRNKNN ending was intended all along. YechielMan 04:18, 6 February 2007 (UTC)
- Take that back. I looked at it again. My source had KRBKNN for Amelung, but the length record for 6 men was KRNKNN. I added a sentence to make it work. YechielMan 09:40, 9 February 2007 (UTC)
[edit] Shredderbases
Should the Shredderbases be explained in this article or seperately? └ VodkaJazz / talk ┐ 17:44, 8 December 2006 (UTC)
- There is an external link to a web server which uses Shredder's tablebases. If that's what you mean by "Shredderbases", then we've got it covered. Anyway this article is mostly about the concept of tablebases, without focusing on individual variants of product. YechielMan 04:17, 6 February 2007 (UTC)
[edit] GA failed
This article has been failed according to the GA criteria. The formatting of the inline citations need to be fixed, and more importantly, more need to be added. Look throughout the article and if there is any statement that somebody may question if it's verifiable add an inline citation. Look to other GA/FAs for examples. The article is interesting to read and has a lot of information, but needs better sourcing to pass. Add the citations before nominating again. Let me know if you have any questions on my talk page. --Nehrams2020 09:19, 24 February 2007 (UTC)
[edit] Earliest chess playing computer programs?
This article says: "In 1951, Alan Turing designed a primitive chess playing program, which assigned values for material and mobility; the program "played" chess based on Turing's manual calculations". However, the Los Alamos chess article says that it was written in 1956 and "was the first chess-like game played by a computer program." Now, I think there's a contradiction between these two pieces of information. Turing's program in 1951 vs. Los Alamos chess in 1956. I think one of the articles needs to be corrected. --ZeroOne (talk | @) 23:40, 24 March 2007 (UTC)
- I'll try to check "How Computers Play Chess" for the dates. That should resolve the question. YechielMan 15:07, 25 March 2007 (UTC)
