{"width":"100%","provider_name":"Hatena Blog","author_name":"kiririmode","title":"\u554f\u984c2-42 (2.2.3  Sequences as Conventional Interfaces)","type":"rich","blog_url":"https://kiririmode.hatenablog.jp/","author_url":"https://blog.hatena.ne.jp/kiririmode/","url":"https://kiririmode.hatenablog.jp/entry/20071209/p2","height":"190","categories":["SICP"],"blog_title":"\u7406\u7cfb\u5b66\u751f\u65e5\u8a18","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkiririmode.hatenablog.jp%2Fentry%2F20071209%2Fp2\" title=\"\u554f\u984c2-42 (2.2.3  Sequences as Conventional Interfaces) - \u7406\u7cfb\u5b66\u751f\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"\u304b\u306e\u6709\u540d\u306an-queen\u554f\u984c\u3092scheme\u3067\u89e3\u304f\u3088!! mNC[\u00e2\u00e8(N Queens Problem) \u6614prolog\u30678-queen\u554f\u984c\u89e3\u304f\u30d7\u30ed\u30b0\u30e9\u30e0\u66f8\u304f\u306e\u306b\u30af\u30bd\u6642\u9593\u304b\u304b\u3063\u305f\u6c17\u304c\u3059\u308b\u3093\u3067\u3059\u3051\u3069\u3001\u4eca\u56de\u3082\u7d50\u69cb\u304b\u304b\u3063\u305f\u3002 SICP\u306f\u512a\u3057\u3044\u306e\u3067\u3001\u3053\u3093\u306a\u30b9\u30b1\u30eb\u30c8\u30f3\u3092\u7528\u610f\u3057\u3066\u304f\u308c\u3066\u3044\u307e\u3059\u3002 (define (queens board-size) (define (queen-cols k) (if (= k 0) (list empty-board) (filter (lambda (positions) (safe? k positions)) (flatmap (lambda (rest-of-q\u2026","published":"2007-12-09 00:00:01","provider_url":"https://hatena.blog","version":"1.0","image_url":null}