{"title":"关于对非极大极小玩家进行两人零和博弈","authors":"G. Burgin","doi":"10.1109/TSSC.1969.300230","DOIUrl":null,"url":null,"abstract":"Results on a practical method for exploiting weakness in the play of an opponent in two-person zero-sum games are reported. Finite-state machines obtained by an evolutionary process are used to determine the move against a nonminimax opponent and achieve average payoffs significantly better than the value of the game.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1969-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"On Playing Two-Person Zero-Sum Games against Nonminimax Players\",\"authors\":\"G. Burgin\",\"doi\":\"10.1109/TSSC.1969.300230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Results on a practical method for exploiting weakness in the play of an opponent in two-person zero-sum games are reported. Finite-state machines obtained by an evolutionary process are used to determine the move against a nonminimax opponent and achieve average payoffs significantly better than the value of the game.\",\"PeriodicalId\":120916,\"journal\":{\"name\":\"IEEE Trans. Syst. Sci. Cybern.\",\"volume\":\"24 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1969-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Trans. Syst. Sci. Cybern.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSSC.1969.300230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Syst. Sci. Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSSC.1969.300230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Playing Two-Person Zero-Sum Games against Nonminimax Players
Results on a practical method for exploiting weakness in the play of an opponent in two-person zero-sum games are reported. Finite-state machines obtained by an evolutionary process are used to determine the move against a nonminimax opponent and achieve average payoffs significantly better than the value of the game.