{"id":22354776,"url":"https://github.com/pprp/chessproblem","last_synced_at":"2025-03-26T12:41:57.591Z","repository":{"id":112698833,"uuid":"165190740","full_name":"pprp/chessProblem","owner":"pprp","description":"棋盘问题，可视化求解","archived":false,"fork":false,"pushed_at":"2019-04-20T07:29:09.000Z","size":141,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-31T13:43:57.527Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pprp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-01-11T06:22:16.000Z","updated_at":"2019-12-27T08:54:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"d1fcf882-d00f-40a4-b298-1cab43a00b28","html_url":"https://github.com/pprp/chessProblem","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprp%2FchessProblem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprp%2FchessProblem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprp%2FchessProblem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pprp%2FchessProblem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pprp","download_url":"https://codeload.github.com/pprp/chessProblem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245658981,"owners_count":20651519,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-12-04T13:15:15.451Z","updated_at":"2025-03-26T12:41:57.581Z","avatar_url":"https://github.com/pprp.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# chessProblem\n:octocat:  棋盘问题，可视化求解\n\n---\n\n\u003e 在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。\n\u003e\n\u003e 输入：每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n \u003c= 8 , k \u003c= n 随后的n行描述了棋盘的形状：每行有n个字符，其中 # 表示棋盘区域， . 表示空白区域（数据保证不出现多余的空白行或者空白列）。\n\u003e\n\u003e 输出：对于每一组数据，给出一行输出，输出摆放的方案数目C （数据保证C\u003c2^31）。\n\u003e\n\u003e  \n\u003e\n\u003e 样例1：\n\u003e\n\u003e 2 1\n\u003e\n\u003e \\#.\n\u003e\n\u003e .#\n\u003e\n\u003e 输出1：\n\u003e\n\u003e 2\n\u003e\n\u003e 样例2：\n\u003e\n\u003e 4 4\n\u003e\n\u003e ...#\n\u003e\n\u003e ..#.\n\u003e\n\u003e .#..\n\u003e\n\u003e \\#...\n\u003e\n\u003e 输出2：\n\u003e\n\u003e 1\n\n算法：回溯法\n\nrelease: 需要将exe文件放在与Data文件夹同目录的位置，才能使用。\n\n![1547191233964](1547191233964.png)\n\n自定义棋盘：\n\n![1547191265969](1547191265969.png)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpprp%2Fchessproblem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpprp%2Fchessproblem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpprp%2Fchessproblem/lists"}