{"title":"棋局的表现","authors":"B. Bošković, S. Greiner, J. Brest, V. Zumer","doi":"10.1109/ITI.2005.1491153","DOIUrl":null,"url":null,"abstract":"Implementation of a fast chess program is a formidable task from many perspectives. The architecture of a programming model is vital to get the best performance. Instead of building a chess program based on knowledge we opted for speed instead. We implemented the majority of all key concepts which turned out to be very efficient in our chess program design. Tests have shown relatively high rating of our implementation despite the simple evaluation function.","PeriodicalId":392003,"journal":{"name":"27th International Conference on Information Technology Interfaces, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"The representation of chess game\",\"authors\":\"B. Bošković, S. Greiner, J. Brest, V. Zumer\",\"doi\":\"10.1109/ITI.2005.1491153\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Implementation of a fast chess program is a formidable task from many perspectives. The architecture of a programming model is vital to get the best performance. Instead of building a chess program based on knowledge we opted for speed instead. We implemented the majority of all key concepts which turned out to be very efficient in our chess program design. Tests have shown relatively high rating of our implementation despite the simple evaluation function.\",\"PeriodicalId\":392003,\"journal\":{\"name\":\"27th International Conference on Information Technology Interfaces, 2005.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th International Conference on Information Technology Interfaces, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2005.1491153\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"27th International Conference on Information Technology Interfaces, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2005.1491153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation of a fast chess program is a formidable task from many perspectives. The architecture of a programming model is vital to get the best performance. Instead of building a chess program based on knowledge we opted for speed instead. We implemented the majority of all key concepts which turned out to be very efficient in our chess program design. Tests have shown relatively high rating of our implementation despite the simple evaluation function.