{"title":"数独我重复一遍","authors":"Miguel G. Palomo","doi":"10.3233/ICG-210180","DOIUrl":null,"url":null,"abstract":"We present a variant of Sudoku called Sudoku Ripeto. It seems to be the first to admit any combination of repeated symbols, and includes Sudoku as a proper subset. We present other Sudoku Ripeto families, each with a different repetition pattern. We define Sudoku Ripeto squares and puzzles, prove several solving rules that generalize those for Sudoku, and give sufficient conditions to flexibly solve puzzles with rules only, without search.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"94 1","pages":"26-49"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sudoku Ripeto\",\"authors\":\"Miguel G. Palomo\",\"doi\":\"10.3233/ICG-210180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a variant of Sudoku called Sudoku Ripeto. It seems to be the first to admit any combination of repeated symbols, and includes Sudoku as a proper subset. We present other Sudoku Ripeto families, each with a different repetition pattern. We define Sudoku Ripeto squares and puzzles, prove several solving rules that generalize those for Sudoku, and give sufficient conditions to flexibly solve puzzles with rules only, without search.\",\"PeriodicalId\":14829,\"journal\":{\"name\":\"J. Int. Comput. Games Assoc.\",\"volume\":\"94 1\",\"pages\":\"26-49\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Int. Comput. Games Assoc.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/ICG-210180\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/ICG-210180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a variant of Sudoku called Sudoku Ripeto. It seems to be the first to admit any combination of repeated symbols, and includes Sudoku as a proper subset. We present other Sudoku Ripeto families, each with a different repetition pattern. We define Sudoku Ripeto squares and puzzles, prove several solving rules that generalize those for Sudoku, and give sufficient conditions to flexibly solve puzzles with rules only, without search.