Minor changes to some of the model info tabs etc

base-models/5.18-simmap.nlogo

@@ -327,7 +327,7 @@ You should consult that book for more information and details of the model.
 
 The desired number and relative proportions of habitat classes are specified in the associated file `5.18-classes.txt`.  The first line of that file specifies the number of classes required, and their relative (integer) proportions are given by the numbers (one to a line) in the remainder of the file.
 
-Note that this implementation provides the option via the `sequentially-assign-clusters?` switch of assigning percolation clusters to habitat classes in order from largest to smallest.  This can make a substantial difference to the resulting landscapes when their are large imbalances among the proportions required, or when the percolation threshold `p` is close to or greater than the critical value _p<sub>c</sub>_.
+Note that this implementation provides the option via the `sequentially-assign-clusters?` switch of assigning percolation clusters to habitat classes in order from largest to smallest.  This can make a substantial difference to the resulting landscapes when there are large imbalances among the proportions required, or when the percolation threshold `p` is close to or greater than the critical value _p<sub>c</sub>_.
 
 ## HOW TO CITE
 

base-models/5.5-invasionPercolationWithTrapping.nlogo

@@ -514,7 +514,7 @@ This will label all the patches in the 'queue' to be invaded next (from lowest v
 
 ## THINGS TO NOTICE
 
-The complicated part of this model is associated with detecting traps. The basic algorithm above is operated by maintaing a queue `next-to-invade`.  This is a list of patches next to already invaded patches (strictly north, south or east of invaded patches), that is kept ordered by the randomly generated `p` values assigned during model setup. Maintenance of the queue order is managed by the `insert-in-order` procedure.  By this mains the basic operation is
+The complicated part of this model is associated with detecting traps. The basic algorithm above is operated by maintaing a queue `next-to-invade`.  This is a list of patches next to already invaded patches (strictly north, south or east of invaded patches), that is kept ordered by the randomly generated `p` values assigned during model setup. Maintenance of the queue order is managed by the `insert-in-order` procedure.  By this means the basic operation is
 
     while not at right edge [
       invade first patch in next-to-invade-list

base-models/6.2-majority-rule-under-different-update-models.nlogo

@@ -205,7 +205,7 @@ CHOOSER
 update-mode
 update-mode
 "synchronous" "async all random" "async random" "async ordered"
-0
+3
 
 SWITCH
 72
@@ -234,34 +234,6 @@ This model is referenced in Chapter 6 of
 
 where the details of these different updating schemes are described in more detail.
 
-## HOW IT WORKS
-
-This section could explain what rules the agents use to create the overall behavior of the model.
-
-## HOW TO USE IT
-
-This section could explain how to use the model, including a description of each of the items in the interface tab.
-
-## THINGS TO NOTICE
-
-This section could give some ideas of things for the user to notice while running the model.
-
-## THINGS TO TRY
-
-This section could give some ideas of things for the user to try to do (move sliders, switches, etc.) with the model.
-
-## EXTENDING THE MODEL
-
-This section could give some ideas of things to add or change in the procedures tab to make the model more complicated, detailed, accurate, etc.
-
-## NETLOGO FEATURES
-
-This section could point out any especially interesting or unusual features of NetLogo that the model makes use of, particularly in the Procedures tab.  It might also point out places where workarounds were needed because of missing features.
-
-## RELATED MODELS
-
-This section could give the names of models in the NetLogo Models Library or elsewhere which are of related interest.
-
 ## HOW TO CITE
 
 If you mention this model in a publication, please include these citations for the model itself and for NetLogo

base-models/6.3-event-queue-simple.nlogo

@@ -67,7 +67,7 @@ to setup
 end
 
 to go
-  ;; model stops all of either resource has been exploited
+  ;; model stops if all of either resource has been exploited
   ;; the event-based half will always be exploited first
   if sum [resource] of e-patches = 0 or sum [resource] of t-patches = 0 [stop]
   ;; event-based

base-models/6.4-hex-array-voter.nlogo

@@ -38,7 +38,7 @@ to setup
   ;; make a row of hex shaped turtles
   ask bottom-row [
     sprout-hexes 1 [
-      set size 0.95
+      set size 1.1
       set hex-row 0
       set hex-col pxcor
       set ycor ycor + 0.3
@@ -89,11 +89,11 @@ end
 GRAPHICS-WINDOW
 145
 10
-603
-469
+753
+619
 -1
 -1
-9.0
+12.0
 1
 8
 1

base-models/6.5-voronoi-voter.nlogo

@@ -95,11 +95,11 @@ end
 GRAPHICS-WINDOW
 195
 10
-605
-421
+806
+622
 -1
 -1
-2.0
+3.0
 1
 10
 1