; ABT for the graph-coloring problem ; by Ionel Muscalagiu ( mionel@fih.utt.ro ) ; and Jose M. Vidal ; ; breeds [vertices ] ; ;edges is a list of lists: a 2D array indexed by who. The value is 1 if there is a link, 0 otherwise. ;num-colors ;domain is the list of allowed colors globals [edges domain no-more-messages tmp nr_cicluri number-of-edges done] ;parent is the 'who' of the parent ;parent-agent is the actual parent ;children is a list of the 'who' of the children ;children-agent is an agentset of the children ;level in the tree. root is 0 ;descendant-neighbors is a list of the 'who' of all vertices that are descendants and have a constraint with me ;the-neighbors is a list of the initial neighbors nodes ;extendend-neighbors is a list of the 'who' of all vertices that have a constraint with me ; ;message-queue contains the incoming messages. We take new ones out from the head. ;current-view is a list indexed by queen number [col0 col1 col2...] col = -1 if unknown. ;nogoods is a list of inconsistent positions [0 1 1 0 ... ] where 0 is good and 1 is no-good. ;messages-recieved is the number of messages this vertice has received. vertices-own [message-queue parent parent-agent children children-agent level descendant-neighbors the-neighbors extendend-neighbors dfs-neighbors dfs-change colorn current-view nogoods messages-received_ok messages-received_nogood nr_constraintc AgentC_Cost messages-received messages-received_nogoodold nrgstoc] ;returns a list of legnth n where each item is v to-report make-list [n v] locals [res] set res [] repeat n [ set res fput v res] report res end to make-link [v1 v2] locals [aux] if (v2 < v1)[ set aux v2 set v2 v1 set v1 aux] if (not neighbors? v1 v2) [ set edges replace-item v1 edges (lput v2 (item v1 edges)) ] end to-report neighbors? [v1 v2] locals [aux] if (v2 < v1) [ set aux v2 set v2 v1 set v1 aux] report member? v2 (item v1 edges) end ;reports true if edges and num-vertices represent a connected graph ;trebuie sa verificam pentru ca altfel nu are sens sa mai rezolvam problema to-report connected? locals [clique i j] set i 0 set clique [] set clique lput i clique set i 1 set j 0 while [j < num-vertices][ while [i < num-vertices][ if (not member? i clique)[ if (not empty? filter [neighbors? ? i] clique)[ set clique lput i clique if (length clique = num-vertices)[ report true ] ] ] set i i + 1 ] set j j + i ] report false end ;sets 'edges' and 'the-neighbors' to make-edges locals [edges-created v1 v2 aux] set edges make-list num-vertices [] set edges-created 0 if num-vertices * edge-density > (num-vertices * (num-vertices - 1)) / 2 [set edge-density ( num-vertices - 1 ) / 2] while [edges-created < num-vertices * edge-density][ set v1 (random-int-or-float num-vertices) set v2 (random-int-or-float num-vertices) if (v1 > v2) [ set aux v2 set v2 v1 set v1 aux ] if (v1 != v2 and (not neighbors? v1 v2))[ make-link v1 v2 set edges-created (edges-created + 1) ] ] set v1 0 while [v1 < num-vertices][ set tmp (item v1 edges) set (the-neighbors-of (turtle v1)) [] set v2 0 while [v2 < num-vertices][ if (neighbors? v1 v2)[ set (the-neighbors-of (turtle v1)) lput v2 the-neighbors-of (turtle v1) ] set v2 v2 + 1 ] set v1 v1 + 1 ] if (not connected?)[ print "Graph not connected. Generating again..." make-edges] set number-of-edges edges-created end to load-edges_file locals [edges-created v1 v2 aux i nod culoare] file-open "graf30-2.0.txt" set num-vertices file-read set edge-density file-read set number-of-edges file-read set edges make-list num-vertices [] set edges-created 0 while [edges-created < num-vertices * edge-density][ set v1 file-read set v2 file-read if (v1 > v2) [ set aux v2 set v2 v1 set v1 aux ] if (v1 != v2 and (not neighbors? v1 v2))[ make-link v1 v2 set edges-created (edges-created + 1) ] ] set v1 0 show edge-density show num-vertices while [v1 < num-vertices][ set tmp (item v1 edges) set (the-neighbors-of (turtle v1)) [] set v2 0 while [v2 < num-vertices][ if (neighbors? v1 v2)[ set (the-neighbors-of (turtle v1)) lput v2 the-neighbors-of (turtle v1) ] set v2 v2 + 1 ] set v1 v1 + 1 ] file-close end to set-parent locals [parents] set parents filter [? < who] dfs-neighbors ifelse (empty? parents) [ set parent -1 ;the root ][ if (dfs-change) [ ;jmv added dfs-change variable set parent max parents ] ] end to set-level ifelse (parent = -1)[ set level 0 ][ set level (level-of parent-agent) + 1 ] end ; n is length of list ; el is the element to-report get-list [n el] locals [i lst] set i 0 set lst [] while [i < n] [ set lst fput el lst set i i + 1] report lst end ;vertice function to find-best-position locals [possible-patches siblings best-patch] ifelse (parent = -1) [ set xcor 0 ][ set siblings vertices with [self != myself and (level = level-of myself or who = parent-of myself)] set possible-patches patches with [distance-nowrap myself < 20 and (pycor = round ycor-of myself)] set best-patch max-one-of possible-patches [sum values-from siblings [log (distance-nowrap myself + .1) 2]] set xcor (pxcor-of best-patch) if (xcor < 0 - screen-edge-x + 50) [set xcor 0 - screen-edge-x + 50] if (xcor > screen-edge-x - 10) [set xcor screen-edge-x - 10] ] end ;vertices function. Draws an edge from this vertice to other-vertice to draw-edge [other-vertice col] locals [dista oc ox oy] set oc color set ox xcor set oy ycor set color col set dista distance-nowrap other-vertice set heading towards-nowrap other-vertice pen-down fd dista pen-up set color oc setxy ox oy set heading 0 end to draw-edges locals [v1] set v1 0 while [v1 < num-vertices][ no-display ask (turtle v1) [ without-interruption [ foreach the-neighbors [ draw-edge (turtle ?) blue ] ] ] display set v1 v1 + 1 ] end to set-dfs-tree ask vertices [ set dfs-neighbors the-neighbors set parent -2 set children [] set message-queue [] set dfs-change true set-parent ] ;ugly hack: add an edge between any parent-child that does not have one ask vertices [ if (parent != -1 and (not member? parent the-neighbors))[ make-link who parent set the-neighbors lput parent the-neighbors set (the-neighbors-of (turtle parent)) lput who (the-neighbors-of (turtle parent)) show "Added extra edge " + who + " - " + parent ] ] ;sets the parent-agent and children ask vertices [ if (parent != -1) [ set parent-agent (turtle parent) set children-of parent-agent fput who (children-of parent-agent) ] ] end to setup-vertices locals [i] set nr_cicluri 0 show "Setup" set domain [] set i 0 while [i < num-colors][ set domain lput item i [15 105 64 125 45 85 35 55 5] domain set i i + 1 ] create-vertices num-vertices ask vertices [ set size 12 set shape "circle" set heading 0 set parent -2 set label who set messages-received 0 set messages-received_ok 0 set messages-received_nogood 0 set messages-received_nogoodold 0 set nr_constraintc 0 set current-view get-list num-vertices -1 set nogoods get-list num-vertices 0 set message-queue [] set AgentC_Cost 0 if (who != 0) [ set-current-plot "Messages" create-temporary-plot-pen "" + who set-current-plot-pen "" + who set-plot-pen-color (5 + 10 * who) mod 140 set-current-plot "Constraint checks" create-temporary-plot-pen "" + who set-current-plot-pen "" + who set-plot-pen-color (5 + 10 * who) mod 140 ] set color item (random-int-or-float num-colors) domain set colorn position color domain ] make-edges ;load-edges_file end to setup-patches locals [i] set-dfs-tree repeat num-vertices [ ask vertices [ set-level ] ] set i max values-from vertices [level] ; set i 8 ask vertices [ ;set level who + 1 set ycor (screen-edge-y - 20) - (level * ((screen-size-y - 30) / i)) ] repeat 8 [ ask vertices [ find-best-position ] ] draw-edges end to WriteSolution show "Solution" ask vertices [ show colorn + " " ] end to setup ca file-close clear-output setup-vertices setup-patches set done false ask vertices [initialize set extendend-neighbors the-neighbors ] end to update set no-more-messages true set nr_cicluri nr_cicluri + 1 if done [show "No solution" stop] ask vertices [ if (not empty? message-queue)[ set no-more-messages false]] if (no-more-messages) [ WriteSolution stop] ask vertices [handle-message] ask vertices [ set-current-plot "Messages" create-temporary-plot-pen "q" + who plot messages-received_nogood plot messages-received_ok set-current-plot "Constraint checks" create-temporary-plot-pen "q" + who plot nr_constraintc ] if (show-trace)[ print "==============" ask vertices [ show "view=" + current-view show "nogood=" + nogoods]] end ;;;; ;;vertices functions ;; to receive-message [msg] without-interruption [ set message-queue lput msg message-queue] end to-report retrieve-message locals [msg] without-interruption [ set msg first message-queue set message-queue butfirst message-queue ] report msg end ;;;Tree utility functions to send-message [receiver msg] without-interruption [ set message-queue-of (turtle receiver) lput msg (message-queue-of (turtle receiver)) ] set messages-received-of (turtle receiver) messages-received-of (turtle receiver) + 1 end to initialize locals [msg] foreach the-neighbors [ if (? > who) [set msg (list "ok" (list who colorn) AgentC_Cost) send-message ? msg] ] end ;Get the msg and dispatch it to the appropiate function to handle-message locals [msg xj dj sender msgnog SenderC_Cost] if (empty? message-queue) [stop] set msg retrieve-message ;set messages-received messages-received + 1 if (first msg = "ok") [ set xj item 0 (item 1 msg) set dj item 1 (item 1 msg) set messages-received_ok messages-received_ok + 1 set SenderC_Cost item 2 msg if SenderC_Cost > AgentC_Cost [ set AgentC_Cost SenderC_Cost ] ok xj dj ] if (first msg = "nogood") [ set SenderC_Cost item 3 msg if SenderC_Cost > AgentC_Cost [ set AgentC_Cost SenderC_Cost ] set sender item 1 msg set msgnog item 2 msg nogood sender msgnog set messages-received_nogood messages-received_nogood + 1 ] if (first msg = "addl") [ SetLink item 1 msg ] end ; this is the Ok? procedure in the paper where Qj = Xj and Vj = dj to ok [Qj Vj ] set current-view replace-item Qj current-view Vj check-agent-view end to-report agents-in-context [cont] locals [i res] set i 0 set res [] while [i < num-vertices][ if (item i cont != -1) [ set res lput i res ] set i i + 1 ] report res end to-report locate-who-nogood [ n ] locals [whon gasit lagent] set lagent agents-in-context current-view set whon n - 1 set gasit false while [not gasit ] [ ifelse ( member? whon lagent ) [set gasit true] [set whon whon - 1] ] report whon end to SetLink [ Sender] locals [msg] if not member? Sender extendend-neighbors [ set extendend-neighbors lput Sender extendend-neighbors set extendend-neighbors sort extendend-neighbors set msg (list "ok" (list who colorn) AgentC_Cost) send-message Sender msg ] end to-report Is_oldnogood [beef whosend] locals [i] set i 0 while [i < who ] [ if ( (item i beef) != (item i current-view) and (item i beef) != -1 and (item i current-view) != -1 and member? i extendend-neighbors) [report true] set i (i + 1) ] if ((item who beef) != (colorn) and (item who beef) != -1) [report true] report false end ; this is the nogood procedure from the paper to nogood [whosend beef ] locals [ i j msg whonog oldvalue k] ;does this nogood apply to my current view? if (Is_oldnogood beef whosend ) [ if (item who beef = colorn) ;and (member? whosend extendend-neighbors) [ set msg (list "ok" (list who colorn) AgentC_Cost) send-message whosend msg ] stop ] ;mark current position as no good ;set nogoods replace-item colorn nogoods 1 set nrgstoc nrgstoc + 1 set i 0 while [i < who ] [ if (not member? i extendend-neighbors) and ((item i beef ) != -1) [ set msg (list "addl" who ) send-message i msg set current-view (replace-item i current-view (item i beef)) set extendend-neighbors lput i extendend-neighbors set extendend-neighbors sort extendend-neighbors set extendend-neighbors remove-duplicates extendend-neighbors ] set i (i + 1) ] set oldvalue colorn set nogoods replace-item colorn nogoods 1 Check-agent-view1 if ( oldvalue = colorn ) [ set msg (list "ok" (list who colorn) AgentC_Cost) send-message whosend msg ] end to check-agent-view locals [ i j msg whonog consistent k col] set i 0 set consistent true while [ i < who ] ;for each vertices [ set nr_constraintc nr_constraintc + 1 set AgentC_Cost AgentC_Cost + 1 if (colorn = item i current-view) and ( neighbors? who i) [ set consistent false ] set i i + 1 ] set nogoods get-list num-colors 0 set i 0 while [ i < who ] ;for each vertices [ set j 0 while [ j < num-colors ] ;for each color [ set nr_constraintc nr_constraintc + 1 set AgentC_Cost AgentC_Cost + 1 if ( j = (item i current-view) and ( neighbors? i who ) and (item i current-view != -1 )) [set nogoods replace-item j nogoods 1] set j (j + 1)] set i (i + 1) ] if ( not consistent ) [ set col 0 set k 0 while [ col < num-colors and k = 0] [ if ( item Col nogoods = 0 ) [ set i 0 set consistent true while [ i < who ] ;for each vertices [ set nr_constraintc nr_constraintc + 1 set AgentC_Cost AgentC_Cost + 1 if ( col = (item i current-view) and ( neighbors? who i)) [ set consistent false] set i i + 1 ] if consistent [ set colorn col ;setxy (colorn - screen-edge-x) (screen-edge-y - who) set color item colorn domain set msg (list "ok" (list who colorn) AgentC_Cost) foreach extendend-neighbors [ if (? > who ) [send-message ? msg] ] set k 1 ] ; [ set nogoods replace-item col nogoods 1] ] set col (col + 1) ] if (k = 0 ) [BackTrack] ] end to check-agent-view1 locals [ i j msg whonog consistent k col] set col 0 set k 0 while [ col < num-colors and k = 0] [ if ( item Col nogoods = 0 ) [ set i 0 set consistent true while [ i < who ] ;for each vertices [ set nr_constraintc nr_constraintc + 1 set AgentC_Cost AgentC_Cost + 1 if ( col = (item i current-view) and ( neighbors? who i)) [ set consistent false] set i i + 1 ] if consistent [ set colorn col ;setxy (colorn - screen-edge-x) (screen-edge-y - who) set color item colorn domain set msg (list "ok" (list who colorn) AgentC_Cost) foreach extendend-neighbors [ if (? > who ) [send-message ? msg] ] set k 1 ] ] set col (col + 1) ] if (k = 0 ) [BackTrack ] end to BackTrack locals [msg whonog] if (who = 0);no consistent colors and I'm highest priority [ show "No solution" set done true stop ] set msg (list "nogood" who current-view AgentC_Cost ) set whonog locate-who-nogood who send-message whonog msg set current-view (replace-item whonog current-view -1) UpdateNogood check-agent-view1 end to UpdateNogood locals [i j] set nogoods get-list num-colors 0 set i 0 while [ i < who ] ;for each vertices [ set j 0 while [ j < num-colors ] ;for each color [ set nr_constraintc nr_constraintc + 1 set AgentC_Cost AgentC_Cost + 1 if ( j = (item i current-view) and ( neighbors? i who ) and (item i current-view != -1 )) [set nogoods replace-item j nogoods 1] set j (j + 1)] set i (i + 1) ] end @#$#@#$#@ GRAPHICS-WINDOW 248 10 719 496 153 151 1.502 1 10 1 1 1 CC-WINDOW 729 10 982 495 Command Center BUTTON 0 10 81 43 NIL setup NIL 1 T OBSERVER T SLIDER 2 45 174 78 num-vertices num-vertices 0 100 10 1 1 NIL BUTTON 82 10 163 43 NIL update NIL 1 T OBSERVER T BUTTON 163 10 245 45 NIL update T 1 T OBSERVER T SWITCH 4 78 109 111 show-trace show-trace 1 1 -1000 PLOT 5 264 242 443 Messages Cycles Msg nogood 0.0 10.0 0.0 10.0 true false PENS "Messages" 1.0 2 -16777216 true "default" 1.0 0 -16777216 true MONITOR 176 47 251 96 Msgs nogood sum (values-from vertices [messages-received_nogood]) 0 1 MONITOR 176 99 242 148 Msgs ok sum (values-from vertices [messages-received_ok]) 3 1 MONITOR 116 153 218 202 Cycles nr_cicluri 0 1 MONITOR 3 184 103 233 Constraint checks sum (values-from vertices [nr_constraintc]) 0 1 PLOT 7 450 243 630 Constraint checks Cycles Constraint checks 0.0 10.0 0.0 10.0 true false SLIDER 4 113 176 146 edge-density edge-density 0.5 5 1.6 0.1 1 NIL SLIDER 3 149 114 182 num-colors num-colors 0 10 3 1 1 NIL MONITOR 115 206 220 255 Cumulattive Cost max (values-from vertices [AgentC_Cost]) 3 1 @#$#@#$#@ Title: Graph Coloring using Asynchronous Backtracking Author: Ionel Muscalagiu, Jose M. Vidal Description: This is the implementation of the Asynchronous Backtracking for the graph coloring problem. We solve the graph coloring problem using the ABT algorithm from @#$#@#$#@ default true 0 Polygon -7566196 true true 150 5 40 250 150 205 260 250 ant true 0 Polygon -7566196 true true 136 61 129 46 144 30 119 45 124 60 114 82 97 37 132 10 93 36 111 84 127 105 172 105 189 84 208 35 171 11 202 35 204 37 186 82 177 60 180 44 159 32 170 44 165 60 Polygon -7566196 true true 150 95 135 103 139 117 125 149 137 180 135 196 150 204 166 195 161 180 174 150 158 116 164 102 Polygon -7566196 true true 149 186 128 197 114 232 134 270 149 282 166 270 185 232 171 195 149 186 149 186 Polygon -7566196 true true 225 66 230 107 159 122 161 127 234 111 236 106 Polygon -7566196 true true 78 58 99 116 139 123 137 128 95 119 Polygon -7566196 true true 48 103 90 147 129 147 130 151 86 151 Polygon -7566196 true true 65 224 92 171 134 160 135 164 95 175 Polygon -7566196 true true 235 222 210 170 163 162 161 166 208 174 Polygon -7566196 true true 249 107 211 147 168 147 168 150 213 150 arrow true 0 Polygon -7566196 true true 150 0 0 150 105 150 105 293 195 293 195 150 300 150 bee true 0 Polygon -256 true false 151 152 137 77 105 67 89 67 66 74 48 85 36 100 24 116 14 134 0 151 15 167 22 182 40 206 58 220 82 226 105 226 134 222 Polygon -16777216 true false 151 150 149 128 149 114 155 98 178 80 197 80 217 81 233 95 242 117 246 141 247 151 245 177 234 195 218 207 206 211 184 211 161 204 151 189 148 171 Polygon -7566196 true true 246 151 241 119 240 96 250 81 261 78 275 87 282 103 277 115 287 121 299 150 286 180 277 189 283 197 281 210 270 222 256 222 243 212 242 192 Polygon -16777216 true false 115 70 129 74 128 223 114 224 Polygon -16777216 true false 89 67 74 71 74 224 89 225 89 67 Polygon -16777216 true false 43 91 31 106 31 195 45 211 Line -1 false 200 144 213 70 Line -1 false 213 70 213 45 Line -1 false 214 45 203 26 Line -1 false 204 26 185 22 Line -1 false 185 22 170 25 Line -1 false 169 26 159 37 Line -1 false 159 37 156 55 Line -1 false 157 55 199 143 Line -1 false 200 141 162 227 Line -1 false 162 227 163 241 Line -1 false 163 241 171 249 Line -1 false 171 249 190 254 Line -1 false 192 253 203 248 Line -1 false 205 249 218 235 Line -1 false 218 235 200 144 bird1 false 0 Polygon -7566196 true true 2 6 2 39 270 298 297 298 299 271 187 160 279 75 276 22 100 67 31 0 bird2 false 0 Polygon -7566196 true true 2 4 33 4 298 270 298 298 272 298 155 184 117 289 61 295 61 105 0 43 boat1 false 0 Polygon -1 true false 63 162 90 207 223 207 290 162 Rectangle -6524078 true false 150 32 157 162 Polygon -16776961 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7566196 true true 158 33 230 157 182 150 169 151 157 156 Polygon -7566196 true true 149 55 88 143 103 139 111 136 117 139 126 145 130 147 139 147 146 146 149 55 boat2 false 0 Polygon -1 true false 63 162 90 207 223 207 290 162 Rectangle -6524078 true false 150 32 157 162 Polygon -16776961 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7566196 true true 157 54 175 79 174 96 185 102 178 112 194 124 196 131 190 139 192 146 211 151 216 154 157 154 Polygon -7566196 true true 150 74 146 91 139 99 143 114 141 123 137 126 131 129 132 139 142 136 126 142 119 147 148 147 boat3 false 0 Polygon -1 true false 63 162 90 207 223 207 290 162 Rectangle -6524078 true false 150 32 157 162 Polygon -16776961 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7566196 true true 158 37 172 45 188 59 202 79 217 109 220 130 218 147 204 156 158 156 161 142 170 123 170 102 169 88 165 62 Polygon -7566196 true true 149 66 142 78 139 96 141 111 146 139 148 147 110 147 113 131 118 106 126 71 box true 0 Polygon -7566196 true true 45 255 255 255 255 45 45 45 butterfly1 true 0 Polygon -16777216 true false 151 76 138 91 138 284 150 296 162 286 162 91 Polygon -7566196 true true 164 106 184 79 205 61 236 48 259 53 279 86 287 119 289 158 278 177 256 182 164 181 Polygon -7566196 true true 136 110 119 82 110 71 85 61 59 48 36 56 17 88 6 115 2 147 15 178 134 178 Polygon -7566196 true true 46 181 28 227 50 255 77 273 112 283 135 274 135 180 Polygon -7566196 true true 165 185 254 184 272 224 255 251 236 267 191 283 164 276 Line -7566196 true 167 47 159 82 Line -7566196 true 136 47 145 81 Circle -7566196 true true 165 45 8 Circle -7566196 true true 134 45 6 Circle -7566196 true true 133 44 7 Circle -7566196 true true 133 43 8 circle false 0 Circle -7566196 true true 35 35 230 person false 0 Circle -7566196 true true 155 20 63 Rectangle -7566196 true true 158 79 217 164 Polygon -7566196 true true 158 81 110 129 131 143 158 109 165 110 Polygon -7566196 true true 216 83 267 123 248 143 215 107 Polygon -7566196 true true 167 163 145 234 183 234 183 163 Polygon -7566196 true true 195 163 195 233 227 233 206 159 sheep false 15 Rectangle -1 true true 90 75 270 225 Circle -1 true true 15 75 150 Rectangle -16777216 true false 81 225 134 286 Rectangle -16777216 true false 180 225 238 285 Circle -16777216 true false 1 88 92 spacecraft true 0 Polygon -7566196 true true 150 0 180 135 255 255 225 240 150 180 75 240 45 255 120 135 thin-arrow true 0 Polygon -7566196 true true 150 0 0 150 120 150 120 293 180 293 180 150 300 150 truck-down false 0 Polygon -7566196 true true 225 30 225 270 120 270 105 210 60 180 45 30 105 60 105 30 Polygon -8716033 true false 195 75 195 120 240 120 240 75 Polygon -8716033 true false 195 225 195 180 240 180 240 225 truck-left false 0 Polygon -7566196 true true 120 135 225 135 225 210 75 210 75 165 105 165 Polygon -8716033 true false 90 210 105 225 120 210 Polygon -8716033 true false 180 210 195 225 210 210 truck-right false 0 Polygon -7566196 true true 180 135 75 135 75 210 225 210 225 165 195 165 Polygon -8716033 true false 210 210 195 225 180 210 Polygon -8716033 true false 120 210 105 225 90 210 turtle true 0 Polygon -7566196 true true 138 75 162 75 165 105 225 105 225 142 195 135 195 187 225 195 225 225 195 217 195 202 105 202 105 217 75 225 75 195 105 187 105 135 75 142 75 105 135 105 wolf false 0 Rectangle -7566196 true true 15 105 105 165 Rectangle -7566196 true true 45 90 105 105 Polygon -7566196 true true 60 90 83 44 104 90 Polygon -16777216 true false 67 90 82 59 97 89 Rectangle -1 true false 48 93 59 105 Rectangle -16777216 true false 51 96 55 101 Rectangle -16777216 true false 0 121 15 135 Rectangle -16777216 true false 15 136 60 151 Polygon -1 true false 15 136 23 149 31 136 Polygon -1 true false 30 151 37 136 43 151 Rectangle -7566196 true true 105 120 263 195 Rectangle -7566196 true true 108 195 259 201 Rectangle -7566196 true true 114 201 252 210 Rectangle -7566196 true true 120 210 243 214 Rectangle -7566196 true true 115 114 255 120 Rectangle -7566196 true true 128 108 248 114 Rectangle -7566196 true true 150 105 225 108 Rectangle -7566196 true true 132 214 155 270 Rectangle -7566196 true true 110 260 132 270 Rectangle -7566196 true true 210 214 232 270 Rectangle -7566196 true true 189 260 210 270 Line -7566196 true 263 127 281 155 Line -7566196 true 281 155 281 192 wolf-left false 3 Polygon -6524078 true true 117 97 91 74 66 74 60 85 36 85 38 92 44 97 62 97 81 117 84 134 92 147 109 152 136 144 174 144 174 103 143 103 134 97 Polygon -6524078 true true 87 80 79 55 76 79 Polygon -6524078 true true 81 75 70 58 73 82 Polygon -6524078 true true 99 131 76 152 76 163 96 182 104 182 109 173 102 167 99 173 87 159 104 140 Polygon -6524078 true true 107 138 107 186 98 190 99 196 112 196 115 190 Polygon -6524078 true true 116 140 114 189 105 137 Rectangle -6524078 true true 109 150 114 192 Rectangle -6524078 true true 111 143 116 191 Polygon -6524078 true true 168 106 184 98 205 98 218 115 218 137 186 164 196 176 195 194 178 195 178 183 188 183 169 164 173 144 Polygon -6524078 true true 207 140 200 163 206 175 207 192 193 189 192 177 198 176 185 150 Polygon -6524078 true true 214 134 203 168 192 148 Polygon -6524078 true true 204 151 203 176 193 148 Polygon -6524078 true true 207 103 221 98 236 101 243 115 243 128 256 142 239 143 233 133 225 115 214 114 wolf-right false 3 Polygon -6524078 true true 170 127 200 93 231 93 237 103 262 103 261 113 253 119 231 119 215 143 213 160 208 173 189 187 169 190 154 190 126 180 106 171 72 171 73 126 122 126 144 123 159 123 Polygon -6524078 true true 201 99 214 69 215 99 Polygon -6524078 true true 207 98 223 71 220 101 Polygon -6524078 true true 184 172 189 234 203 238 203 246 187 247 180 239 171 180 Polygon -6524078 true true 197 174 204 220 218 224 219 234 201 232 195 225 179 179 Polygon -6524078 true true 78 167 95 187 95 208 79 220 92 234 98 235 100 249 81 246 76 241 61 212 65 195 52 170 45 150 44 128 55 121 69 121 81 135 Polygon -6524078 true true 48 143 58 141 Polygon -6524078 true true 46 136 68 137 Polygon -6524078 true true 45 129 35 142 37 159 53 192 47 210 62 238 80 237 Line -16777216 false 74 237 59 213 Line -16777216 false 59 213 59 212 Line -16777216 false 58 211 67 192 Polygon -6524078 true true 38 138 66 149 Polygon -6524078 true true 46 128 33 120 21 118 11 123 3 138 5 160 13 178 9 192 0 199 20 196 25 179 24 161 25 148 45 140 Polygon -6524078 true true 67 122 96 126 63 144 @#$#@#$#@ NetLogo 2.0.2 @#$#@#$#@ @#$#@#$#@ @#$#@#$#@