René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"递归：棋盘分割问题","articleBody":"问题：8*8的棋盘缺个角，问，如何用L型的地板砖铺满。\n\n```\ndef cover(board, lab=1, top=0, left=0, side=None):\n    if side is None: side = len(board)\n    s = side // 2\n    offsets = (0,-1), (side-1,0)\n    #outer 用来检测哪个角上缺了个\n    #inner 用来把棋盘分割为4个子问题\n    for dy_outer, dy_inner in offsets:\n        for dx_outer, dx_inner in offsets:\n            if not board[top+dy_outer][left+dx_outer]:\n                board[top+dy_inner+s][left+dx_inner+s] = lab\n\n    lab += 1\n    if s \u003e 1:\n        for dy in [0,s]:\n            for dx in [0,s]:\n                lab = cover(board, lab, top+dy, left+dx, s)\n    return lab\nboard = [[0]*8 for i in range(8)]\nboard[7][7] = -1\ncover(board)\nfor row in board:\n    print((\" %2i\"*8)% tuple(row))\n```\n\nresult：\n\n```\n  3  3  4  4  8  8  9  9\n  3  2  2  4  8  7  7  9\n  5  2  6  6 10 10  7 11\n  5  5  6  1  1 10 11 11\n 13 13 14  1 18 18 19 19\n 13 12 14 14 18 17 17 19\n 15 12 12 16 20 17 21 21\n 15 15 16 16 20 20 21 -1\n```\n","author":{"url":"https://github.com/sunstrikes","@type":"Person","name":"sunstrikes"},"datePublished":"2016-03-05T13:02:13.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/2/Algorithm/issues/2"}