So how would you tackle, lets say n-queen problem on m square board (for realy huge m) knowing that additional small set of chess pieces can be added to the problem (let's say K K N N B) the new pieces attack fraction of the board potentially not taken by any queens so far. Some of prev solutions would be no longer valid of course but for sure adding new pieces will not add new queen placements. It only limits it. Would be it possible to extend Clojure.logic to reuse prev results, or I should forget about it and restart search from scratch?
Daniel On Apr 26, 2012 7:55 PM, "David Nolen" <dnolen.li...@gmail.com> wrote: > On Thu, Apr 26, 2012 at 1:38 PM, Daniel Kwiecinski < > daniel.kwiecin...@gmail.com> wrote: > >> Does it make sense at all to you. >> > > Makes sense, but sounds outside the scope of what core.logic currently > does. > > David > > -- > You received this message because you are subscribed to the Google > Groups "Clojure" group. > To post to this group, send email to clojure@googlegroups.com > Note that posts from new members are moderated - please be patient with > your first post. > To unsubscribe from this group, send email to > clojure+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/clojure?hl=en -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
