|
|
@ -15,7 +15,7 @@
|
|
|
|
(let loop ([argss argss][acc empty])
|
|
|
|
(let loop ([argss argss][acc empty])
|
|
|
|
(if (null? argss)
|
|
|
|
(if (null? argss)
|
|
|
|
(yield (reverse acc))
|
|
|
|
(yield (reverse acc))
|
|
|
|
(for ([arg (in-list (car argss))])
|
|
|
|
(for ([arg (car argss)])
|
|
|
|
(loop (cdr argss) (cons arg acc))))))))
|
|
|
|
(loop (cdr argss) (cons arg acc))))))))
|
|
|
|
|
|
|
|
|
|
|
|
(struct csp (vars constraints [assignments #:auto] [checks #:auto])
|
|
|
|
(struct csp (vars constraints [assignments #:auto] [checks #:auto])
|
|
|
@ -74,9 +74,9 @@
|
|
|
|
((csp? (or/c (listof name?) procedure?)) ((or/c (listof any/c) procedure?)) . ->* . void?)
|
|
|
|
((csp? (or/c (listof name?) procedure?)) ((or/c (listof any/c) procedure?)) . ->* . void?)
|
|
|
|
(for/fold ([vrs (vars prob)]
|
|
|
|
(for/fold ([vrs (vars prob)]
|
|
|
|
#:result (set-csp-vars! prob vrs))
|
|
|
|
#:result (set-csp-vars! prob vrs))
|
|
|
|
([name (in-list (if (procedure? names-or-procedure)
|
|
|
|
([name (in-list (match names-or-procedure
|
|
|
|
(names-or-procedure)
|
|
|
|
[(? procedure? proc) (proc)]
|
|
|
|
names-or-procedure))])
|
|
|
|
[names names]))])
|
|
|
|
(when (memq name (map var-name vrs))
|
|
|
|
(when (memq name (map var-name vrs))
|
|
|
|
(raise-argument-error 'add-vars! "var that doesn't already exist" name))
|
|
|
|
(raise-argument-error 'add-vars! "var that doesn't already exist" name))
|
|
|
|
(append vrs (list (var name
|
|
|
|
(append vrs (list (var name
|
|
|
@ -200,11 +200,15 @@
|
|
|
|
|
|
|
|
|
|
|
|
(define (reset-nfcs!) (set! nfchecks 0))
|
|
|
|
(define (reset-nfcs!) (set! nfchecks 0))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(define nchecks 0)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(define (reset-nchecks!) (set! nchecks 0))
|
|
|
|
|
|
|
|
|
|
|
|
(define/contract (assign-val prob name val)
|
|
|
|
(define/contract (assign-val prob name val)
|
|
|
|
(csp? name? any/c . -> . csp?)
|
|
|
|
(csp? name? any/c . -> . csp?)
|
|
|
|
(when-debug (set! nassns (add1 nassns)))
|
|
|
|
(when-debug (set! nassns (add1 nassns)))
|
|
|
|
(make-csp
|
|
|
|
(make-csp
|
|
|
|
(for/list ([vr (vars prob)])
|
|
|
|
(for/list ([vr (in-vars prob)])
|
|
|
|
(if (eq? name (var-name vr))
|
|
|
|
(if (eq? name (var-name vr))
|
|
|
|
(assigned-var name (list val))
|
|
|
|
(assigned-var name (list val))
|
|
|
|
vr))
|
|
|
|
vr))
|
|
|
@ -278,14 +282,14 @@
|
|
|
|
(define/contract (forward-check prob ref-name)
|
|
|
|
(define/contract (forward-check prob ref-name)
|
|
|
|
(csp? name? . -> . csp?)
|
|
|
|
(csp? name? . -> . csp?)
|
|
|
|
(define aval (first (find-domain prob ref-name)))
|
|
|
|
(define aval (first (find-domain prob ref-name)))
|
|
|
|
(define (check-var v)
|
|
|
|
(define (check-var vr)
|
|
|
|
(match v
|
|
|
|
(match vr
|
|
|
|
;; don't check against assigned vars, or the reference var
|
|
|
|
;; don't check against assigned vars, or the reference var
|
|
|
|
;; (which is probably assigned but maybe not)
|
|
|
|
;; (which is probably assigned but maybe not)
|
|
|
|
[(? (λ (x) (or (assigned-var? x) (eq? (var-name x) ref-name)))) v]
|
|
|
|
[(? (λ (x) (or (assigned-var? x) (eq? (var-name x) ref-name)))) vr]
|
|
|
|
[(var name vals)
|
|
|
|
[(var name vals)
|
|
|
|
(match ((constraints prob) . relating-only . (list ref-name name))
|
|
|
|
(match ((constraints prob) . relating-only . (list ref-name name))
|
|
|
|
[(? empty?) v]
|
|
|
|
[(? empty?) vr]
|
|
|
|
[constraints
|
|
|
|
[constraints
|
|
|
|
(define new-vals
|
|
|
|
(define new-vals
|
|
|
|
(for/list ([val (in-list vals)]
|
|
|
|
(for/list ([val (in-list vals)]
|
|
|
@ -295,15 +299,15 @@
|
|
|
|
(proc val aval)
|
|
|
|
(proc val aval)
|
|
|
|
(proc aval val)))))
|
|
|
|
(proc aval val)))))
|
|
|
|
val))
|
|
|
|
val))
|
|
|
|
(checked-variable name new-vals (cons ref-name (match v
|
|
|
|
(checked-variable name new-vals (cons ref-name (match vr
|
|
|
|
[(checked-variable _ _ history) history]
|
|
|
|
[(checked-variable _ _ history) history]
|
|
|
|
[else null])))])]))
|
|
|
|
[else null])))])]))
|
|
|
|
(define checked-vars (map check-var (vars prob)))
|
|
|
|
(define checked-vars (map check-var (vars prob)))
|
|
|
|
(when-debug (set! nfchecks (+ (length checked-vars) nchecks)))
|
|
|
|
(when-debug (set! nfchecks (+ (length checked-vars) nchecks)))
|
|
|
|
;; conflict-set will be empty if there are no empty domains (as we would hope)
|
|
|
|
;; conflict-set will be empty if there are no empty domains (as we would hope)
|
|
|
|
(define conflict-set (for*/list ([cv (in-list checked-vars)]
|
|
|
|
(define conflict-set (for*/list ([cvr (in-list checked-vars)]
|
|
|
|
#:when (empty? (domain cv))
|
|
|
|
#:when (empty? (domain cvr))
|
|
|
|
[name (in-list (history cv))])
|
|
|
|
[name (in-list (history cvr))])
|
|
|
|
name))
|
|
|
|
name))
|
|
|
|
;; for conflict-directed backjumping it's essential to forward-check ALL vars
|
|
|
|
;; for conflict-directed backjumping it's essential to forward-check ALL vars
|
|
|
|
;; (even after an empty domain is generated) and combine their conflicts
|
|
|
|
;; (even after an empty domain is generated) and combine their conflicts
|
|
|
@ -337,8 +341,6 @@
|
|
|
|
(define (singleton-var? var)
|
|
|
|
(define (singleton-var? var)
|
|
|
|
(= 1 (domain-length var)))
|
|
|
|
(= 1 (domain-length var)))
|
|
|
|
|
|
|
|
|
|
|
|
(define nchecks 0)
|
|
|
|
|
|
|
|
(define (reset-nchecks!) (set! nchecks 0))
|
|
|
|
|
|
|
|
(define/contract (check-constraints prob [mandatory-names #f] #:conflicts [conflict-count? #f])
|
|
|
|
(define/contract (check-constraints prob [mandatory-names #f] #:conflicts [conflict-count? #f])
|
|
|
|
((csp?) ((listof name?) #:conflicts boolean?) . ->* . (or/c csp? natural?))
|
|
|
|
((csp?) ((listof name?) #:conflicts boolean?) . ->* . (or/c csp? natural?))
|
|
|
|
;; this time, we're not limited to assigned variables
|
|
|
|
;; this time, we're not limited to assigned variables
|
|
|
@ -491,17 +493,6 @@
|
|
|
|
(apply append (map vars probs))
|
|
|
|
(apply append (map vars probs))
|
|
|
|
(apply append (map csp-constraints probs))))
|
|
|
|
(apply append (map csp-constraints probs))))
|
|
|
|
|
|
|
|
|
|
|
|
(define/contract (make-cartesian-generator solgens)
|
|
|
|
|
|
|
|
((listof generator?) . -> . generator?)
|
|
|
|
|
|
|
|
(generator ()
|
|
|
|
|
|
|
|
(define solstreams (for/list ([solgen (in-list solgens)])
|
|
|
|
|
|
|
|
(for/stream ([sol (in-producer solgen (void))])
|
|
|
|
|
|
|
|
sol)))
|
|
|
|
|
|
|
|
(let loop ([solstreams solstreams][sols empty])
|
|
|
|
|
|
|
|
(if (null? solstreams)
|
|
|
|
|
|
|
|
(yield (combine-csps (reverse sols)))
|
|
|
|
|
|
|
|
(for ([sol (in-stream (car solstreams))])
|
|
|
|
|
|
|
|
(loop (cdr solstreams) (cons sol sols)))))))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(define/contract (extract-subcsp prob names)
|
|
|
|
(define/contract (extract-subcsp prob names)
|
|
|
|
(csp? (listof name?) . -> . csp?)
|
|
|
|
(csp? (listof name?) . -> . csp?)
|
|
|
@ -528,9 +519,14 @@
|
|
|
|
(extract-subcsp prob nodeset))
|
|
|
|
(extract-subcsp prob nodeset))
|
|
|
|
(list prob)))
|
|
|
|
(list prob)))
|
|
|
|
|
|
|
|
|
|
|
|
(for/list ([solution (in-producer (make-cartesian-generator (map solver subcsps)) (void))]
|
|
|
|
(define solgens (map solver subcsps))
|
|
|
|
|
|
|
|
(define solstreams (for/list ([solgen (in-list solgens)])
|
|
|
|
|
|
|
|
(for/stream ([sol (in-producer solgen (void))])
|
|
|
|
|
|
|
|
sol)))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(for/list ([solution-pieces (in-cartesian solstreams)]
|
|
|
|
[idx (in-range max-solutions)])
|
|
|
|
[idx (in-range max-solutions)])
|
|
|
|
(finish-proc solution)))
|
|
|
|
(finish-proc (combine-csps solution-pieces))))
|
|
|
|
|
|
|
|
|
|
|
|
(define/contract (solve prob
|
|
|
|
(define/contract (solve prob
|
|
|
|
#:finish-proc [finish-proc csp->assocs]
|
|
|
|
#:finish-proc [finish-proc csp->assocs]
|
|
|
|