{"title":"探索mod 2 n-queens游戏","authors":"Tricia Muldoon Brown, Abrahim Ladha","doi":"10.2478/rmm-2019-0002","DOIUrl":null,"url":null,"abstract":"Abstract We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the parity of the number of queens already on the board which can attack that square. The game is explored as well as its variations and complexity.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exploring mod 2 n-queens games\",\"authors\":\"Tricia Muldoon Brown, Abrahim Ladha\",\"doi\":\"10.2478/rmm-2019-0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the parity of the number of queens already on the board which can attack that square. The game is explored as well as its variations and complexity.\",\"PeriodicalId\":120489,\"journal\":{\"name\":\"Recreational Mathematics Magazine\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Recreational Mathematics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/rmm-2019-0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Recreational Mathematics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/rmm-2019-0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract We introduce a two player game on an n × n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the parity of the number of queens already on the board which can attack that square. The game is explored as well as its variations and complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
