SIGTPC(小组会议)

ACM '76 Pub Date : 1976-10-20 DOI:10.1145/800191.805656

M. Newborn

{"title":"SIGTPC(小组会议)","authors":"M. Newborn","doi":"10.1145/800191.805656","DOIUrl":null,"url":null,"abstract":"Authors of the programs competing in the Seventh Annual United States Computer Chess Championship will discuss the state of computer chess programming. Topics to be considered include chess oriented tree searching heuristics, tree searching heuristics that can also be used for more general problems, the pros and cons of exhaustive and selective searches, the present level of play and prospects for future improvement. An attempt will be made to summarize progress to date covering the time since the ACM tournament began in 1970.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIGTPC (Panel Session)\",\"authors\":\"M. Newborn\",\"doi\":\"10.1145/800191.805656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Authors of the programs competing in the Seventh Annual United States Computer Chess Championship will discuss the state of computer chess programming. Topics to be considered include chess oriented tree searching heuristics, tree searching heuristics that can also be used for more general problems, the pros and cons of exhaustive and selective searches, the present level of play and prospects for future improvement. An attempt will be made to summarize progress to date covering the time since the ACM tournament began in 1970.\",\"PeriodicalId\":379505,\"journal\":{\"name\":\"ACM '76\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1976-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '76\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800191.805656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '76","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800191.805656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

参加第七届年度美国计算机国际象棋锦标赛的程序作者将讨论计算机国际象棋编程的状态。要考虑的主题包括面向国际象棋的树搜索启发式，也可用于更一般问题的树搜索启发式，详尽搜索和选择性搜索的利弊，当前的游戏水平和未来改进的前景。将尝试总结自1970年ACM锦标赛开始以来迄今为止的进展。

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

查看原文本刊更多论文

SIGTPC (Panel Session)

Authors of the programs competing in the Seventh Annual United States Computer Chess Championship will discuss the state of computer chess programming. Topics to be considered include chess oriented tree searching heuristics, tree searching heuristics that can also be used for more general problems, the pros and cons of exhaustive and selective searches, the present level of play and prospects for future improvement. An attempt will be made to summarize progress to date covering the time since the ACM tournament began in 1970.

求助全文

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

来源期刊

ACM '76

自引率

0.00%

发文量