| 1. Title: Chess End-Game -- King+Rook versus King+Pawn on a7 | (usually abbreviated KRKPA7). The pawn on a7 means it is one square | away from queening. It is the King+Rook's side (white) to move. | | 2. Sources: | (a) Database originally generated and described by Alen Shapiro. | (b) Donor/Coder: Rob Holte (holte@uottawa.bitnet). The database | was supplied to Holte by Peter Clark of the Turing Institute | in Glasgow (pete@turing.ac.uk). | (c) Date: 1 August 1989 | | 3. Past Usage: | - Alen D. Shapiro (1983,1987), "Structured Induction in Expert Systems", | Addison-Wesley. This book is based on Shapiro's Ph.D. thesis (1983) | at the University of Edinburgh entitled "The Role of Structured | Induction in Expert Systems". | - Stephen Muggleton (1987), "Structuring Knowledge by Asking Questions", | pp.218-229 in "Progress in Machine Learning", edited by I. Bratko | and Nada Lavrac, Sigma Press, Wilmslow, England SK9 5BB. | - Robert C. Holte, Liane Acker, and Bruce W. Porter (1989), | "Concept Learning and the Problem of Small Disjuncts", | Proceedings of IJCAI. Also available as technical report AI89-106, | Computer Sciences Department, University of Texas at Austin, | Austin, Texas 78712. | | 4. Relevant Information: | The dataset format is described below. Note: the format of this | database was modified on 2/26/90 to conform with the format of all | the other databases in the UCI repository of machine learning databases. | | 5. Number of Instances: 3196 total | | 6. Number of Attributes: 36 | | 7. Attribute Summaries: | Classes (2): -- White-can-win ("won") and White-cannot-win ("nowin"). | I believe that White is deemed to be unable to win if the Black pawn | can safely advance. | Attributes: see Shapiro's book. | | 8. Missing Attributes: -- none | | 9. Class Distribution: | In 1669 of the positions (52%), White can win. | In 1527 of the positions (48%), White cannot win. | | The format for instances in this database is a sequence of 37 attribute values. | Each instance is a board-descriptions for this chess endgame. The first | 36 attributes describe the board. The last (37th) attribute is the | classification: "win" or "nowin". There are 0 missing values. | A typical board-description is | 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 | f,f,f,f,f,f,f,f,f,f,f,f,l,f,n,f,f,t,f,f,f,f,f,f,f,t,f,f,f,f,f,f,f,t,t,n,won | | The names of the features do not appear in the board-descriptions. | Instead, each feature correponds to a particular position in the | feature-value list. For example, the head of this list is the value | for the feature "bkblk". The following is the list of features, in | the order in which their values appear in the feature-value list: | | [bkblk,bknwy,bkon8,bkona,bkspr,bkxbq,bkxcr,bkxwp,blxwp,bxqsq,cntxt,dsopp,dwipd, | hdchk,katri,mulch,qxmsq,r2ar8,reskd,reskr,rimmx,rkxwp,rxmsq,simpl,skach,skewr, | skrxp,spcop,stlmt,thrsk,wkcti,wkna8,wknck,wkovl,wkpos,wtoeg] | | In the file, there is one instance (board position) per line. won, nowin. A00: f,t. A01: f,t. A02: f,t. A03: f,t. A04: f,t. A05: f,t. A06: f,t. A07: f,t. A08: f,t. A09: f,t. A10: f,t. A11: f,t. A12: l,g. A13: f,t. A14: n,w,b. A15: f,t. A16: f,t. A17: f,t. A18: f,t. A19: f,t. A20: f,t. A21: f,t. A22: f,t. A23: f,t. A24: f,t. A25: f,t. A26: f,t. A27: f,t. A28: f,t. A29: f,t. A30: f,t. A31: f,t. A32: f,t. A33: f,t. A34: f,t. A35: n,t.