{"id":18050592,"url":"https://github.com/ehpc/domino-tiling","last_synced_at":"2025-04-05T06:23:36.017Z","repository":{"id":138755653,"uuid":"202552767","full_name":"ehpc/domino-tiling","owner":"ehpc","description":"This jupyter notebook implements an algorithm to count possible covers of m x n rectangle with 1 x 2 dominoes.","archived":false,"fork":false,"pushed_at":"2020-10-20T12:48:34.000Z","size":431,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-10T14:12:34.175Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ehpc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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-08-15T14:09:12.000Z","updated_at":"2020-10-20T18:33:57.000Z","dependencies_parsed_at":null,"dependency_job_id":"8f74c9ed-e35b-4168-aaf3-af9e4e773a01","html_url":"https://github.com/ehpc/domino-tiling","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ehpc%2Fdomino-tiling","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ehpc%2Fdomino-tiling/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ehpc%2Fdomino-tiling/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ehpc%2Fdomino-tiling/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ehpc","download_url":"https://codeload.github.com/ehpc/domino-tiling/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247296231,"owners_count":20915600,"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-10-30T21:12:24.612Z","updated_at":"2025-04-05T06:23:35.937Z","avatar_url":"https://github.com/ehpc.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Domino tiling problem :mahjong:\n\nThis jupyter notebooks implement two algorithms for counting possible covers of `m x n` rectangle with `1 x 2` dominoes.\n\n[This notebook](https://github.com/ehpc/domino-tiling/blob/master/domino-tiling.ipynb) contains an implementation based on Temperley, Fisher, Kasteleyn formula :rabbit:.\n\nAnd [this notebook](https://github.com/ehpc/domino-tiling/blob/master/domino-tiling-recursive.ipynb) contains a detailed explanation of a recursive algorithm aka dynamic programming approach :arrows_counterclockwise:. There is a [PDF](https://github.com/ehpc/domino-tiling/blob/master/domino-tiling-recursive.pdf) version for convenience.\n\n# Useful links\n```\nhttps://en.wikipedia.org/wiki/Domino_tiling\nhttps://ru.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_FKT\nhttps://en.wikipedia.org/wiki/Packing_problems\nhttps://elementy.ru/problems/1612/Poloski_iz_domino\nhttp://www.dep.ufscar.br/docentes/morabito/jors98.pdf\nhttps://www.researchgate.net/publication/233653794_An_effective_recursive_partitioning_approach_for_the_packing_of_identical_rectangles_in_a_rectangle\nhttps://en.wikipedia.org/wiki/Domino_tiling\nhttps://arxiv.org/pdf/math/0310326.pdf\nhttps://www.geeksforgeeks.org/count-number-ways-tile-floor-size-n-x-m-using-1-x-m-size-tiles/\nhttps://www.geeksforgeeks.org/tiling-problem/\nhttps://www.geeksforgeeks.org/tiling-with-dominoes/\nhttps://stackoverflow.com/questions/16388579/spoj-m3tile-solution-explanation\nhttps://www.fq.math.ca/Scanned/18-1/read.pdf\nhttps://stackoverflow.com/questions/31354624/number-of-ways-to-tile-a-w-x-h-grid-with-2-x-1-and-1-x-2-dominos\nhttps://www.quora.com/In-how-many-ways-can-a-MxN-rectangle-be-tiled-using-1x1-and-1x2-elements\nhttp://www.math.cmu.edu/~bwsulliv/domino-tilings.pdf\nhttps://math.stackexchange.com/questions/664113/count-the-ways-to-fill-a-4-times-n-board-with-dominoes\nhttp://algo.inria.fr/seminars/sem01-02/strehl.pdf\nhttps://cp-algorithms.com/dynamic_programming/profile-dynamics.html\nhttps://neerc.ifmo.ru/wiki/index.php?title=%D0%94%D0%B8%D0%BD%D0%B0%D0%BC%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B5_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_%D0%BF%D0%BE_%D0%BF%D1%80%D0%BE%D1%84%D0%B8%D0%BB%D1%8E\nhttp://sk765.blogspot.com/2012/02/dynamic-programming-with-profile.html\nhttps://blog.evilbuggy.com/2018/05/broken-profile-dynamic-programming.html\nhttps://ru.coursera.org/lecture/sportivnoe-programmirovanie/4-5-zadacha-parkiet-dinamika-po-profiliu-k3EYK\nhttps://habr.com/ru/post/191498/\nhttps://archive.lksh.ru/2011/july/B/files/dp-profile.pdf\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fehpc%2Fdomino-tiling","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fehpc%2Fdomino-tiling","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fehpc%2Fdomino-tiling/lists"}