Talk:Endgame tablebase
From Wikipedia, the free encyclopedia
Contents |
[edit] Beyong humans or computers?
I am not sure I am understanding the statement that something that has been done is "beyond the horizon of humans or computers" If it has been done then it has been done by a human or a computer (and abstractly speaking a human is a computer as well). The other option is that it has not been done, but I am assuming the article is claiming that tablebases with this much power have been done. There is not another option, unless that option is magic!
--74.194.27.5 (talk) 04:29, 5 December 2007 (UTC)
[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)
- In The Computer Chess Compendium by David Levy there is an article Chess by Alan M. Turing from Faster Than Thought (B. V. Bowden, Editor), pp. 286-295. London, Pitman (1953). The program is written in english and while it is usually clear which move it would select there are some cases where it is ambigous. I'd say it is a chess playing program while Los Alamos chess is a chess playing computer program, so there is no contradiction between the two pieces of information. Epiteo 16:21, 2 May 2007 (UTC)
[edit] quality
I gave this artice a "B" on the quality scale, but it is likely that it deserves an "A". If anyone thinks so, change it. It is up for FA, so when that is decided one way or the other, the quality scale needs to be changed. Bubba73 (talk), 14:52, 30 April 2007 (UTC)
- I have changed it already, I think it deserves A. Cheers,--Ioannes Pragensis 15:35, 5 May 2007 (UTC)
[edit] GA Pass
I am passing this as GA-class. As a casual chess player, I think it's reasonably clear to nonspecialists, but if you are planning on advancing it to FA, try to keep - and improve - that consistency. Otherwise, no complaints. Chubbles 05:50, 9 May 2007 (UTC)
[edit] Outstanding article
This is an outstanding article. Congratulations to the editor(s) that put it in this shape. One thing I would like to see is for 3, 4, 5, and 6-piece endgames: (1) how many combinations of material there are in each of these, (2) what is the total size of files for each. (3) maybe some similar statistics. Bubba73 (talk), 22:57, 16 July 2007 (UTC)
[edit] A class
Wikipedia:Version_1.0_Editorial_Team/Assessment says that class B "Commonly the highest article grade that is assigned outside a more formal review process." I have no objection to this article being in A Class, but does it need to have a formal review? Bubba73 (talk), 20:09, 26 July 2007 (UTC)
- Since it passed GA above, perhaps it should be changed to GA, pending the review for it to be Class A. Bubba73 (talk), 21:54, 26 July 2007 (UTC)
- This article is currently being assessed at Wikipedia:WikiProject_Chess/Review, please join the discussion. Voorlandt 07:55, 3 August 2007 (UTC)
- The review is finished and the article has failed to go to A-class, so it is assessed as GA-class. You can find the conclusions of the review and hints for improvement at Wikipedia:WikiProject Chess/Review. Thanks to all for your contribution! SyG 13:10, 24 August 2007 (UTC)
You can see the archived discussion hereunder: SyG (talk) 09:02, 1 May 2008 (UTC)
Nomination by youngvalter |
---|
Currently assessed as A-Class by User:Ioannes Pragensis. I'd agree with this - although not promoted to FA, it seems all concerns were addressed, but people got bored with it after it was stayed as an FAC for six weeks. youngvalter 01:24, 3 August 2007 (UTC) |
Review by Voorlandt: conclusion was "Support" |
---|
Support, I think the article largely satisfies the criteria, there are however a few points where the article could be improved. Here is what peerreviewer had to say: (plus one comment from myself). The following suggestions were generated by a semi-automatic javascript program, and might not be applicable for the article in question. You may wish to browse through User:AndyZ/Suggestions for further ideas.
|
Review by SyG: conclusion was "Oppose" |
---|
Oppose, because I basically have one problem with most sentences:
All in all, this article is really great and has a lot of content and a good number of refereces, but I feel there is some "wikifying" to be done. Also, the lead seems fine for anyone who ALREADY knows the subject, but I think a newcomer would be confused by some sentences. SyG 08:10, 9 August 2007 (UTC)
SyG, those are a lot of good points, and it will take me some time to fix most of them. I'll respond quickly to one point: tablebases actually do not analyze backward from drawn positions. They only analyze won positions, and anything that's not a win is, by default, a draw. I mention this in the section on "generating tablebases", and I believe it is mentioned in at least two of the articles used as references (one each by Haworth and Krabbe). Thank you for the feedback. Shalom Hello 19:51, 10 August 2007 (UTC) |
Conclusion by SyG: A-class was failed |
---|
Close the review Given that:
I shall close this review and grade the article as GA-class. The article seems close to A-class, as long as the points underlined hereupon are discussed/addressed. Of course, if you do not agree with my conclusion, I am always open to discussion. SyG 13:06, 24 August 2007 (UTC) |