{"title":"A program for analyzing two move chess problems","authors":"D. Müller","doi":"10.3233/icg-200162","DOIUrl":null,"url":null,"abstract":"This contribution reports about an almost forgotten attempt to find themes in chess composition automatically by machine. Based on investigations of the late International Master of Chess Composition Dieter Müller in the 1970s, the writers describe some of his results. They hope to fill a gap in the great history of chess programming.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"6 1","pages":"171-177"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/icg-200162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This contribution reports about an almost forgotten attempt to find themes in chess composition automatically by machine. Based on investigations of the late International Master of Chess Composition Dieter Müller in the 1970s, the writers describe some of his results. They hope to fill a gap in the great history of chess programming.