{"title":"A chess mating combinations program","authors":"G. W. Baylor, H. Simon","doi":"10.1145/1464182.1464233","DOIUrl":"https://doi.org/10.1145/1464182.1464233","url":null,"abstract":"The program reported here is not a complete chess player; it does not play games. Rather, it is a chess analyst limited to searching for checkmating combinations in positions containing tactical possibilities. A combination in chess is a series of forcing moves with sacrifice that ends with an objective advantage for the active side. A checkmating combination, then, is a combination in which that objective advantage is checkmate. Thus the program described here---dubbed MATER---given a position, proceeds by generating that class of forcing moves that put the enemy King in check or threaten mate in one move, and then by analyzing first those moves that appear most promising.","PeriodicalId":158826,"journal":{"name":"AFIPS '66 (Spring)","volume":"22 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120901001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An optimization model for time-sharing","authors":"D. Fife","doi":"10.1145/1464182.1464193","DOIUrl":"https://doi.org/10.1145/1464182.1464193","url":null,"abstract":"The proper design of scheduling processes for time-shared computers has provoked much discussion. One of the factors promoting discussion is the great variety of scheduling procedures which one can feasibly program, and which will operate with adequate efficiency. There is wide latitude for conjecturing possibly improved procedures. Moreover, the performance requirements of time-sharing demand more sophisticated schemes than one can analyze with simple queueing theory, yet it is not feasible to experiment with many alternative procedures in operational systems and produce quantitative evidence of their relative merits.","PeriodicalId":158826,"journal":{"name":"AFIPS '66 (Spring)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115531006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computer application of electro-optics","authors":"W. Poppelbaum","doi":"10.1145/1464182.1464184","DOIUrl":"https://doi.org/10.1145/1464182.1464184","url":null,"abstract":"The first few years of existence of electro-optics as a separate field have brought to light a wealth of novel ideas and has warmed up a host of old ones as well. It turns out that at this time there are two large classes of ideas which have relatively little overlap: the first class encompasses the development of time-honored techniques into practical low-cost designs; the second class contains the more futuristic devices using laser amplification, laser logic, laser source deflection, etc. Unluckily the latter ideas have not yet reached that stage of development where they can compete with more classical designs as far as cost is concerned. Since the author has devoted a previous paper to them, it might be useful to examine all those areas where patient development has produced reasonably low-cost designs that have proved themselves in practice or are about to do so.","PeriodicalId":158826,"journal":{"name":"AFIPS '66 (Spring)","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134371556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：