This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2017-03-03
Channels
- # bangalore-clj (2)
- # beginners (29)
- # boot (52)
- # cider (4)
- # clara (3)
- # cljs-dev (34)
- # cljsjs (7)
- # cljsrn (3)
- # clojure (71)
- # clojure-austin (1)
- # clojure-dev (5)
- # clojure-france (20)
- # clojure-russia (51)
- # clojure-spec (9)
- # clojure-uk (20)
- # clojurescript (131)
- # core-async (56)
- # core-logic (6)
- # cursive (50)
- # datascript (19)
- # datomic (16)
- # dirac (118)
- # emacs (100)
- # events (4)
- # hoplon (14)
- # incanter (1)
- # jobs (7)
- # jobs-discuss (96)
- # jobs-rus (21)
- # lein-figwheel (5)
- # leiningen (21)
- # off-topic (11)
- # om (45)
- # onyx (42)
- # pamela (1)
- # pedestal (22)
- # portland-or (3)
- # re-frame (8)
- # reagent (5)
- # ring (9)
- # robots (1)
- # spacemacs (14)
- # specter (28)
- # sql (2)
- # untangled (165)
Having a list of integers how would I find the biggest square area that can fit in the columns? With clojure.logic or preferrably with https://github.com/aengelberg/loco. I couldn’t find an example or a tutorial that help me with this kind of problem. Examples:
1234321 321 423
0 0
*** 0 0 0
0***0 ** **0
00***00 **0 **0
= 3 = 2 = 2
I think with logic programming or some kind of sat solver you are going to have trouble, because both of those tend to be good answering "does a solution to this exist" and less so at solving "find me the solution with property x"
actually, I think you can put that in terms of does X exist: "Does X exist where X is a number that fits in row 0, and row 0 + X, and X+1 doesn't fit in row 0 + X + 1"