一个分析两步棋问题的程序

J. Int. Comput. Games Assoc. Pub Date : 2020-01-01 DOI:10.3233/icg-200162

D. Müller

{"title":"一个分析两步棋问题的程序","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":"{\"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}","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

摘要

这篇文章报告了一项几乎被遗忘的尝试，即通过机器自动找到象棋构图中的主题。作者根据20世纪70年代对已故国际象棋作曲大师迪特尔·米勒的调查，描述了他的一些研究成果。他们希望填补国际象棋编程伟大历史上的空白。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A program for analyzing two move chess problems

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

J. Int. Comput. Games Assoc.

自引率

0.00%

发文量