; define new variables to be used by the agents ; IMPORTANT USE TOOL BAR TO CREATE A "SETUP" BUTTON, A "GO" BUTTON, AND A GRAPH globals [ cntpinks cntoranges cntblues cntrts cntlefts ] turtles-own [ unique_number ] ; define four breeds of turtles breed [ rts ] breed [ lefts ] breed [pinks] breed [oranges] breed [blues] to setup clear-all setup-turtles ask patches [ setup-mall ] my-setup-plots reset-ticks end ; create a one-patch-wide mall of white patches at y = 1 to setup-mall if ( pycor = 1 ) [ set pcolor white ] ; to add number coordinates to interface screen if (pycor = 2) [set plabel pxcor] if (pycor = 0) [set plabel pxcor] ; FOR GAME 6 ; ELIMINATE FOR CIRCULAR CODE START ;create screen edge patches where agents turn around if pxcor = max-pxcor and (pycor = 1) [set pcolor green] if pxcor = min-pxcor and (pycor = 1 ) [set pcolor yellow] ; ELIMINATE FOR CIRCULAR CODE STOP. ; create two store locations on either side of the pedestrian area ; one store is pink if ( pycor = 0 and pxcor = pink-location)[ set pcolor pink ] ; one store is orange if ( pycor = 2 ) and ( pxcor = orange-location) [ set pcolor orange ] ; CREATE THIRD STORE LOCATION FOR BLUE STORE ; THE ORANGE STORE CANNOT CHOOSE THE SAME LOCATION AS THE BLUE STORE if (pycor = 2) and (pxcor = blue-location) and pcolor = black [set pcolor blue] end ;create 33 RED AND 33 BLUE turtle shoppers. to setup-turtles set-default-shape turtles "person" create-rts 33 ask rts [ set color red ;scatter rts randomly around screen fd (random max-pxcor) ; Place shoppers on the center of the patch setxy pxcor pycor ] create-lefts 33 ask lefts [ set color blue ;scatter lefts randomly around screen fd (random max-pxcor) ; Place shoppers on the center of the patch setxy pxcor pycor ] end to uniform-distribute ;; eliminate random customers then re-distribute ask turtles [ die ] ask patches [if (pycor = 3 and pxcor > -17 and pxcor < 17) [sprout-rts 1] if (pycor = -1 and pxcor > -17 and pxcor < 17) [sprout-lefts 1] ] ask rts [ set color red setxy pxcor pycor ] ask lefts [ set color blue setxy pxcor pycor ] end to my-setup-plots clear-all-plots set-current-plot "number of pinks, oranges and blues" ; this title must exactly match the title given the graph you set up with the tool-bar. auto-plot-on ; this allows constant re-scaling set-plot-x-range 0 5 set-plot-y-range 0 count turtles create-temporary-plot-pen "pinks" set-plot-pen-color pink create-temporary-plot-pen "oranges" set-plot-pen-color orange create-temporary-plot-pen "blues" set-plot-pen-color blue end ;need to move toward mall. Once reach mall, will move forward one ; spot in one direction. Rts (red) move to the right, lefts (blue) move to the left ; When reach end of the mall, turn around and change to the other type so will move in opposite direction ;TO GO to go ;run-count move-turtles do-plots tick if (cntrts = 0 and cntlefts = 0) [stop] end to move-turtles ; randomly choose which agents to ask first from the population foreach shuffle [self] of turtles [ask ? [ ; Assign a random number to each turtle for random death. set unique_number (random-float 1) ; turn all turtles so they face due north (top of screen) set heading 0 ; move towards mall. All agents start with a "due north" heading. ; if above the mall, turn 180 degrees) if breed = rts and (pcolor != white) and (pcolor != grey) and (pcolor != green) and (pcolor != yellow) and ycor > 1 [rt 180 fd 1] ; if below the mall, already heading due north towards mall if breed = rts and (pcolor != white) and (pcolor != grey) and (pcolor != green) and (pcolor != yellow) and ycor < 1 [fd 1] if breed = lefts and (pcolor != white) and (pcolor != grey) and (pcolor != green) and (pcolor != yellow) and ycor > 1 [rt 180 fd 1] if breed = lefts and (pcolor != white) and (pcolor != grey) and (pcolor != green) and (pcolor != yellow) and ycor < 1 [fd 1] ; check to see if shopper is next to a store. ; Use random to determine if look to right or to left first. Only important if stores are opposite each other. ;look left (down) set heading 180 if unique_number <= 0.5 and [pcolor] of patch-ahead 1 = pink [ fd 1 hatch-pinks 1 set color black die] if unique_number <= 0.5 and [pcolor] of patch-ahead 1 != pink ; now, turn 180 and look right (up) ; BLUE STORE IS ALWAYS ABOVE SO NEED ADD LOOK FOR BLUE ALSO [rt 180] if unique_number <= 0.5 and [pcolor] of patch-ahead 1 = orange [fd 1 hatch-oranges 1 set color white die] ; Because buyers always look for orange first, blue cannot choose same location--no one will ever see them. if unique_number <= 0.5 and [pcolor] of patch-ahead 1 = blue [fd 1 hatch-blues 1 set color white die] ; run same sequence for other, randomly selected shoppers, but look right (up) first set heading 0 if unique_number > 0.5 and [pcolor] of patch-ahead 1 = orange [fd 1 hatch-oranges 1 set color white die] if unique_number > 0.5 and [pcolor] of patch-ahead 1 = blue [fd 1 hatch-blues 1 set color white die] if unique_number > 0.5 and [pcolor] of patch-ahead 1 != orange [rt 180] if unique_number > 0.5 and [pcolor] of patch-ahead 1 = pink [fd 1 hatch-pinks 1 set color white die] ;heading is always re-set to 0 at beginning of loop, to reorient turtle so they move the correct direction set heading 0 ; have rts turn at screen edge and turn into lefts if breed = rts and (pcolor = green) [ lt 90 fd 1 hatch-lefts 1 die] ask lefts [ set color blue] ; if happen to come in at far left end of mall, land on a yellow patch if breed = rts and (pcolor = yellow) [ rt 90 fd 1] ; rts move forward one patch if on the road set heading 0 if breed = rts and (pcolor = white) [ rt 90 fd 1 ] ; lefts move forward one patch if on the road set heading 0 if breed = lefts and (pcolor = white) [ rt 270 fd 1 ] ; have lefts turn at screen edge ; if happen to start at the edge of the mall if breed = lefts and (pcolor = green) [ lt 90 fd 1 ] if breed = lefts and (pcolor = yellow) [ rt 180 fd 1 hatch-rts 1 die] ask rts [ set color red] ] ] end to do-plots set-current-plot "number of pinks, oranges and blues" create-temporary-plot-pen "oranges" plot count oranges create-temporary-plot-pen "pinks" plot count pinks create-temporary-plot-pen "blues" plot count blues end @#$#@#$#@ GRAPHICS-WINDOW 30 16 915 372 17 6 25.0 1 15 1 1 1 0 1 1 1 -17 17 -6 6 0 0 1 ticks 30.0 BUTTON 57 51 112 84 NIL setup NIL 1 T OBSERVER NIL NIL NIL NIL 1 BUTTON 115 52 170 85 NIL go T 1 T OBSERVER NIL NIL NIL NIL 1 PLOT 580 367 874 487 number of pinks, oranges and blues time count 0.0 655.0 0.0 284.0 true false "" "" PENS MONITOR 96 261 171 306 NIL count pinks 17 1 11 MONITOR 184 262 277 307 NIL count oranges 17 1 11 SLIDER 350 245 522 278 pink-location pink-location -16 16 -16 1 1 NIL HORIZONTAL SLIDER 354 292 526 325 orange-location orange-location -16 16 16 1 1 NIL HORIZONTAL SLIDER 355 330 527 363 blue-location blue-location -16 18 18 1 1 NIL HORIZONTAL MONITOR 191 316 279 369 count blues count blues 17 1 13 TEXTBOX 366 386 516 418 set blue = 18 to eliminate third, blue store 13 0.0 1 TEXTBOX 314 415 464 433 NIL 13 0.0 1 BUTTON 286 451 415 484 NIL uniform-distribute NIL 1 T OBSERVER NIL NIL NIL NIL 1 @#$#@#$#@ ## WHAT IS IT? This is a simple model of competing restaurants choosing where to locate in a strip shopping mall. The model supports a series of games, outlined below, that students can use to explore the principle of minimum differentiation aka Hotelling's Law . ## HOW TO USE IT PURPOSE: To gain experintial familiarity with the strengths and weaknesses of the principle of minimum differentiation as a model that explains the observed clustering of retail sellers at a central location. Open the Location Game and click on "setup". You are looking down on a strip shoppping mall with 66 potential lunch buyers scattered around the mall neighborhood. There are two sellers of lunch, represented by an orange and a pink patch at opposite ends of the mall. Sellers can change their starting locations by using the two "location" sliders. Other than location, the sellers are identical. Buyers purchase one, and only one lunch each day. A third, blue seller is built into the game as an option. The initial setup eliminates the blue seller by setting their location at 18, outside of the mall. Click setup. Click go. Each time go is clicked, all buyers move one patch. Repeatedly click go to progress through the game. At noon every day, all buyers begin to move toward the mall. When they reach the mall, they begin to move along the mall in search of a place to eat lunch. The 33 red buyers move to the right. The 33 blue buyers move to the left. When a buyer is directly opposite a seller, they move into the seller location where they are counted as that seller's customer, and then exit the game. Buyers randomly look left or right first; consequently, there is no advantage to being on the left or right side of the mall. When a buyer reaches the end of the mall, they turn aound, change color, and start moving back down the mall in the opposite direction. The counters and graphs show the cumulative number of buyers each seller receives. ## GAME 1: SOCIALLY OPTIMAL (UNIFORM DISTRIBUTION) SINGLE PLAYER You are a benevolant dictator charged with choosing where to locate the two sellers of lunch. Your goal is to choose optimal locations so that buyers minimize their cost of travel time. Travel time is represented in the game by the number of "ticks" needed before all buyers have had lunch. The ticks are counted in the upper left portion of the screen. To reflect Hotelling's initial assumption of evenly distributed buyers, click on the "uniform" button after setup to create a uniform starting distribution of buyers. WHAT IS THE OPTIMAL LOCATION FOR THE TWO STORES? WHAT IS THE TOTAL NUMBER OF TICKS NEEDED AT THIS OPTIMAL LOCATION? DOES THIS TOTAL MATCH OTHER PLAYERS' RESULTS? ## GAME 2: SOCIALLY OPTIMAL (RANDOM DISTRIBUTION) SINGLE PLAYER You are still a benevolant dictator charged with choosing where to locate the two sellers of lunch. Your goal is to choose optimal locations so that buyers minimize their cost of travel time. Travel time is represented in the game by the number of "ticks" needed before all buyers have had lunch. The ticks are counted in the upper left portion of the screen. To make the simulation more realistic than Hortelling's assumption of an even distribution, use the simulation's default, random distribution of buyers (Don't click the uniform button.) WHAT IS THE OPTIMAL LOCATION FOR THE TWO STORES? WHAT IS THE TOTAL NUMBER OF TICKS NEEDED AT THIS OPTIMAL LOCATION? DOES THIS TOTAL MATCH OTHER PLAYERS' RESULTS? WHY IS THE TOTAL TICKS COUNT WITH A RANDOM DISTRIBUTION NOT NECESSARILY CONSISTENT WITH OTHER PLAYERS' RESULTS? DOES THIS ALTER THE SOCIALLY OPTIMAL SOLUTION? ## GAME 3: PRINCIPLE OF MINIMUM DIFFERENTIATION: TWO PLAYERS Two players compete on the same simulation. Each player is a profit-maximizing seller of lunch. The seller with the most buyers ('count-pink" and "count-orange') has the most profit and wins the game. Part of this game is to experience the sequential choices that occur before equilibrium is reached, so the rule is to flip a coin to determine who gets to change location first. After the locations are selected, click through the simulation, and the player with the highest number of buyers must change location first, followed by the other player, followed by a running of the simulation, etc. Because this is a defensive game, going second has advantages. WHERE DO YOU STOP WANTING TO CHANGE LOCATION? IF LOCATION IS THE ONLY THING THAT DIFFERENTIATES YOU FROM YOUR COMPETITOR, HAVE YOU MAXIMIZED OR MINIMIZED THAT DIFFERENTIATION? IS THIS CONSISTENT WITH HOTELLING'S PRINCIPLE OF MINIMUM DIFFERENTIATION? (HOTELLING'S LAW) HOW DOES YOUR PROFIT (NUMBER OF CUSTOMERS) AT THIS EQUILIBRIUM COMPARE TO THE PROFITS FROM THE SOCIALLY OPTIMAL LOCATIONS IN GAME 2? HOW DOES THE SOCIAL WELFARE (NUMBER OF TICKS NEEDED) IN THIS EQUILIBRIUM COMPARE TO THE NUMBER OF TICKS USED IN THE SOCIALLY OPTIMAL OUTCOME OF GAME 2? ## GAME 4: THREE COMPETING PLAYERS Hotelling's principle of minimum differentiation is very dependent on a set of strong assumptions. If the assumption of only two sellers is changed to three sellers, what happens? To find out, now three players are all using the same simulation. The third player controls the location of the blue seller. The orange and blue stores cannot choose the same location due to a programming limitation. The goal is to obtain the most buyers. DO YOU REACH A POINT, AS IN GAME 3, WHERE EVERYONE STOPS WANTING TO CHANGE LOCATION? WHAT DOES THIS SAY ABOUT HOTELLING'S PREDICTION OF THE PRINCIPLE OF MINIMUM DIFFERENTIATION HOLDING TRUE FOR MULTIPLE SELLERS? ## GAME 5: UNEQUAL MARKET POWER AND AGRESSIVE INCUMBENT (TWO PLAYERS, THREE LOCATIONS) The game returns to two players; however, now one player (the incumbent seller) has the option of opening a second (blue) location after the other player decides on their (new) location. This scenario allows the more realistic assumption of different behaviors to be explored. The game begins with the incumbent player’s (orange) store located at one end of the mall (16). Player two (pink) is now given the option of choosing a location. The incumbent (orange) seller cannot move from their starting location at the end of the mall. To create a more complex behavior, assume the incumbent is irrationally aggressive and will use their power to open an additional (blue) location to try to drive any competition out of the mall. Assume the new (pink) seller will fail (lose the game) if they obtain less than fifteen buyers. The incumbent’s new, blue, second-store location is chosen after the new (pink) seller chooses their location. IF YOU ARE THE NEW-STORE PLAYER, WHERE DO YOU WANT TO LOCATE? DO YOU EVEN WANT TO TRY TO OPEN YOUR STORE (CAN YOU SEE ANY WAY TO ALWAYS HAVE AT LEAST 15 CUSTOMERS, REGARDLESS OF WHAT THE INCUMBENT DOES?) ## GAME 6: CIRCULAR MALL TWO PLAYERS This is an opportunity to make a simple modification to the simulation's coding. To modify the program, you need to have downloaded the netlogo software and be running the simulation on your computer. Click on the "Code" tab of the simulation to access the program. The goal is to change the scenario so that buyers are in a circular mall. That can be accomplished by having the simulation default back to the normal netlogo behavior of turtles "wrapping" around the back of the screen when they reach the edge of the screen. This return to the default "wrapping" is accomplished by eliminating the two lines of code that create the end-of-mall colored patches that tell buyers to turn around. Without these patches, buyers simply wrap around the back of the screen and reappear at the other end of the mall, still moving in the same direction. The two lines of code that need to be eliminated are bracketed by comment lines in the program: ELIMINATE FOR CIRCULAR CODE (START) and ELIMINATE FOR CIRCULAR CODE (STOP). The easiest way to experiment with eliminating code is to place a ";" in front of the code line, thereby turning it into a comment. If this causes a programming error, the ";" can be removed and something else can then be tried. ONCE THE CIRCULAR MALL IS CREATED, WITH TWO PLAYERS, IS THE PRINCIPLE OF MINIMUM DIFFERNTIATION OBSERVED AS SELLERS SEEK TO MAXIMIZE PROFIT? ## GAME 7 UNCERTAINTY TWO PLAYERS Even with some of the more realistic assumptions explored in previous games, if an element of uncertainty is introduced into the scenario, the principle of minimum differntiation begins to to again be verified. To see how this can occur, return to GAME 4 scenario of three players in the non-circular strip mall. While players could react to the choices of the other players in GAME 4, now an element of uncertainty is introduced by asking all three players to choose their locations simultaneously so that they don't know what the competition will do. To simulate this, a fourth person acts as gamekeeper and receives the three players' location choices, and then inputs them into the scenario. GIVEN THE UNCERTAINTY OF NOT KNOWING WHERE THE OTHER TWO PLAYERS WILL LOCATE, WHERE DO YOU CHOOSE TO LOCATE? DOES THIS SEEM TO SUPPORT THE PRINCIPLE OF MINIMUM DIFFERENTIATION? ## CREDITS AND REFERENCES Author: Dr. Jeffrey E. Russell Affiliation: Ashland University, Ashland, Ohio Email: jrussell@ashland.edu @#$#@#$#@ default true 0 Polygon -7500403 true true 150 5 40 250 150 205 260 250 ant true 0 Polygon -7500403 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 -7500403 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 -7500403 true true 149 186 128 197 114 232 134 270 149 282 166 270 185 232 171 195 149 186 Polygon -7500403 true true 225 66 230 107 159 122 161 127 234 111 236 106 Polygon -7500403 true true 78 58 99 116 139 123 137 128 95 119 Polygon -7500403 true true 48 103 90 147 129 147 130 151 86 151 Polygon -7500403 true true 65 224 92 171 134 160 135 164 95 175 Polygon -7500403 true true 235 222 210 170 163 162 161 166 208 174 Polygon -7500403 true true 249 107 211 147 168 147 168 150 213 150 arrow true 0 Polygon -7500403 true true 150 0 0 150 105 150 105 293 195 293 195 150 300 150 bee true 0 Polygon -1184463 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 -7500403 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 -7500403 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 -7500403 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 -6459832 true false 150 32 157 162 Polygon -13345367 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7500403 true true 158 33 230 157 182 150 169 151 157 156 Polygon -7500403 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 -6459832 true false 150 32 157 162 Polygon -13345367 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7500403 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 -7500403 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 -6459832 true false 150 32 157 162 Polygon -13345367 true false 150 34 131 49 145 47 147 48 149 49 Polygon -7500403 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 -7500403 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 -7500403 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 -7500403 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 -7500403 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 -7500403 true true 46 181 28 227 50 255 77 273 112 283 135 274 135 180 Polygon -7500403 true true 165 185 254 184 272 224 255 251 236 267 191 283 164 276 Line -7500403 true 167 47 159 82 Line -7500403 true 136 47 145 81 Circle -7500403 true true 165 45 8 Circle -7500403 true true 134 45 6 Circle -7500403 true true 133 44 7 Circle -7500403 true true 133 43 8 car false 0 Polygon -7500403 true true 300 180 279 164 261 144 240 135 226 132 213 106 203 84 185 63 159 50 135 50 75 60 0 150 0 165 0 225 300 225 300 180 Circle -16777216 true false 180 180 90 Circle -16777216 true false 30 180 90 Polygon -16777216 true false 162 80 132 78 134 135 209 135 194 105 189 96 180 89 Circle -7500403 true true 47 195 58 Circle -7500403 true true 195 195 58 circle false 0 Circle -7500403 true true 34 34 230 link true 0 Line -7500403 true 150 0 150 300 link direction true 0 Line -7500403 true 150 150 30 225 Line -7500403 true 150 150 270 225 person false 0 Circle -7500403 true true 155 20 63 Rectangle -7500403 true true 158 79 217 164 Polygon -7500403 true true 158 81 110 129 131 143 158 109 165 110 Polygon -7500403 true true 216 83 267 123 248 143 215 107 Polygon -7500403 true true 167 163 145 234 183 234 183 163 Polygon -7500403 true true 195 163 195 233 227 233 206 159 spacecraft true 0 Polygon -7500403 true true 150 0 180 135 255 255 225 240 150 180 75 240 45 255 120 135 thin-arrow true 0 Polygon -7500403 true true 150 0 0 150 120 150 120 293 180 293 180 150 300 150 truck-down false 0 Polygon -7500403 true true 225 30 225 270 120 270 105 210 60 180 45 30 105 60 105 30 Polygon -8630108 true false 195 75 195 120 240 120 240 75 Polygon -8630108 true false 195 225 195 180 240 180 240 225 truck-left false 0 Polygon -7500403 true true 120 135 225 135 225 210 75 210 75 165 105 165 Polygon -8630108 true false 90 210 105 225 120 210 Polygon -8630108 true false 180 210 195 225 210 210 truck-right false 0 Polygon -7500403 true true 180 135 75 135 75 210 225 210 225 165 195 165 Polygon -8630108 true false 210 210 195 225 180 210 Polygon -8630108 true false 120 210 105 225 90 210 turtle true 0 Polygon -7500403 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-left false 3 Polygon -6459832 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 -6459832 true true 87 80 79 55 76 79 Polygon -6459832 true true 81 75 70 58 73 82 Polygon -6459832 true true 99 131 76 152 76 163 96 182 104 182 109 173 102 167 99 173 87 159 104 140 Polygon -6459832 true true 107 138 107 186 98 190 99 196 112 196 115 190 Polygon -6459832 true true 116 140 114 189 105 137 Rectangle -6459832 true true 109 150 114 192 Rectangle -6459832 true true 111 143 116 191 Polygon -6459832 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 -6459832 true true 207 140 200 163 206 175 207 192 193 189 192 177 198 176 185 150 Polygon -6459832 true true 214 134 203 168 192 148 Polygon -6459832 true true 204 151 203 176 193 148 Polygon -6459832 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 -6459832 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 -6459832 true true 201 99 214 69 215 99 Polygon -6459832 true true 207 98 223 71 220 101 Polygon -6459832 true true 184 172 189 234 203 238 203 246 187 247 180 239 171 180 Polygon -6459832 true true 197 174 204 220 218 224 219 234 201 232 195 225 179 179 Polygon -6459832 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 -6459832 true true 48 143 58 141 Polygon -6459832 true true 46 136 68 137 Polygon -6459832 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 -6459832 true true 38 138 66 149 Polygon -6459832 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 -6459832 true true 67 122 96 126 63 144 @#$#@#$#@ NetLogo 5.0.4 @#$#@#$#@ @#$#@#$#@ @#$#@#$#@ @#$#@#$#@ @#$#@#$#@ default 0.0 -0.2 0 1.0 0.0 0.0 1 1.0 0.0 0.2 0 1.0 0.0 link direction true 0 Line -7500403 true 150 150 90 180 Line -7500403 true 150 150 210 180 @#$#@#$#@ 0 @#$#@#$#@