Ticket #148: cleanup2.patch

config.vcin

@@ -30 +30 @@
 /* GAIN/LOSS codes. Disabled by default. */
 #define EXPERIMENTAL_OWL_EXT 0
 
+/* Disable unneeded things. 0 standard. */
+#define FINAL_RELEASE 0
+
 /* Define as 1 to use the grid optimisation, or 2 to run it in self-test mode
    */
 #define GRID_OPT 1

doc/dfa.texi

@@ -1 +1 @@
 In this chapter, we describe the principles of the GNU Go DFA
 pattern matcher.  The aim of this system is to permit a fast
-pattern matching when it becomes time critical like in owl
-module (@ref{The Owl Code}). Since GNU Go 3.2, this is enabled
+pattern matching. Since GNU Go 3.2, this is enabled
 by default. You can still get back the traditional pattern matcher
 by running @command{configure --disable-dfa} and then recompiling
 GNU Go. 

doc/dragon.texi

@@ -17 +17 @@
 Later routines called by @code{genmove()} will then have access to this
 information. This document attempts to explain the philosophy and
 algorithms of this preliminary analysis, which is carried out by the
-two routines @code{make_worm()} and @code{make_dragon()} in 
-@file{dragon.c}.
+two routines @code{make_worms()} (in @file{worm.c}) and
+@code{make_dragons()} (in @file{dragon.c}).
 
 @cindex dragon
 @cindex worm
@@ -83 +83 @@
   int unconditional_status;
   int attack_points[MAX_TACTICAL_POINTS];
   int attack_codes[MAX_TACTICAL_POINTS];
+  int discarded_attacks[MAX_TACTICAL_POINTS];
   int defense_points[MAX_TACTICAL_POINTS];
   int defend_codes[MAX_TACTICAL_POINTS];
+  int discarded_defenses[MAX_TACTICAL_POINTS];
   int attack_threat_points[MAX_TACTICAL_POINTS];
-  int attack_threat_codes[MAX_TACTICAL_POINTS]; 
+  int attack_threat_codes[MAX_TACTICAL_POINTS];
+  int discarded_att_threats[MAX_TACTICAL_POINTS];
   int defense_threat_points[MAX_TACTICAL_POINTS];
   int defense_threat_codes[MAX_TACTICAL_POINTS];
+  int discarded_def_threats[MAX_TACTICAL_POINTS];
 @};
 @end example
 
@@ -109 +113 @@
 other worm. Intersections that are shared are counted with equal
 fractional values for each worm. This measures the direct territorial
 value of capturing a worm. @dfn{effective_size} is a floating point number.
-Only intersections at a distance of 4 or less are counted.
+Only intersections at a distance (empty vertices between a worm and an
+intersection) of 5 or less are counted.
 @end quotation
 @item @code{origin}
 @quotation
@@ -220 +225 @@
 @end quotation
 @item @code{cutstone2} 
 @quotation
-Cutting points are identified by the patterns in the connections
-database. Proper cuts are handled by the fact that attacking and
+Number of potential cuts involving the worm. Cutting points are
+identified by the patterns in the connections database. Proper
+cuts are handled by the fact that attacking and
 defending moves also count as moves cutting or connecting the
 surrounding dragons.  The @code{cutstone2} field is set during 
 @code{find_cuts()}, called from @code{make_domains()}.
@@ -248 +254 @@
 opposite color can be killed. More precisely an
 @dfn{inessential string} is a string S of genus zero,
 not adjacent to any opponent string which can be easily
-captured, and which has no edge liberties or second
+captured, which is not cutstone, and which has up to
+2 edge liberties and no second
 order liberties, and which satisfies the following
 further property: If the string is removed from the
 board, then the remaining cavity only borders worms of the
@@ -266 +273 @@
 even if the opponent is allowed an arbitrary number of consecutive
 moves.
 @end quotation
-@item unconditional_status
+@item @code{unconditional_status}
 @quotation
 Unconditional status is also set by the function
 @code{unconditional_life}. This is set @code{ALIVE} for stones which are
@@ -285 +292 @@
 transformed into an invincible group by some number of consecutive
 moves. Well, this is not entirely true because there is a rare class of
 seki groups not satisfying this condition. Exactly which these are is
-left as an exercise for the reader. Currently @code{unconditional_life},
-which strictly follows the definitions above, calls such seki groups
-unconditionally dead, which of course is a misfeature. It is possible to
-avoid this problem by making the algorithm slightly more complex, but
-this is left for a later revision.
+shown in a comment in @file{unconditional.c}.
 @end quotation
-@item @code{int attack_points[MAX_TACTICAL_POINTS]}
-@item @code{attack_codes[MAX_TACTICAL_POINTS]}
+@item @code{int attack_points[MAX_TACTICAL_POINTS];}
+@item @code{int attack_codes[MAX_TACTICAL_POINTS];}
 @item @code{int defense_points[MAX_TACTICAL_POINTS];}
 @item @code{int defend_codes[MAX_TACTICAL_POINTS];}
 @quotation
@@ -310 +313 @@
 @quotation
 These are points that threaten to attack or defend a worm.
 @end quotation
+@item @code{int discarded_attacks[MAX_TACTICAL_POINTS];}
+@item @code{int discarded_defenses[MAX_TACTICAL_POINTS];}
+@item @code{int discarded_att_threats[MAX_TACTICAL_POINTS];}
+@item @code{int discarded_def_threats[MAX_TACTICAL_POINTS];}
+@quotation
+These are checked points that haven't led to any positive result.
+Used to not check the same point more than once.
+@end quotation
 @end itemize
 
 The function @code{makeworms()} will generate data for all worms.
@@ -343 +354 @@
 XXX...       
 
 @end example
-@findex dragon_eye
-
-The code for this type of amalgamation is in the routine
-@code{dragon_eye()}, discussed further in EYES.
 
 Next, we amalgamate strings which seem uncuttable. We amalgamate dragons
 which either share two or more common liberties, or share one liberty
@@ -367 +374 @@
 @section Connection
 @cindex connections
 
-The fields @code{black_eye.cut} and @code{white_eye.cut} are set where the
+The fields in @code{cutting_points} are set where the
 opponent can cut, and this is done by the B (break) class patterns in
-@file{conn.db}.  There are two important uses for this field, which can be
+@file{conn.db}.  There are two important uses for this table, which can be
 accessed by the autohelper functions @code{xcut()} and @code{ocut()}. The
 first use is to stop amalgamation in positions like
 
@@ -534 +541 @@
   int safety;
   float weakness;
   float weakness_pre_owl;
+  float strategic_size;
   int escape_route;
   struct eyevalue genus;
   int heye;
@@ -541 +549 @@
   int surround_status;
   int surround_size;
   int semeais;
-  int semeai_margin_of_safety;
+  int semeai_defense_code;
   int semeai_defense_point;
-  int semeai_defense_certain;  
+  int semeai_defense_certain;
+  int semeai_defense_target;
+  int semeai_attack_code;
   int semeai_attack_point;
   int semeai_attack_certain;
+  int semeai_attack_target;
   int owl_threat_status;
   int owl_status;
   int owl_attack_point;
   int owl_attack_code;
   int owl_attack_certain;
+  int owl_attack_node_count;
   int owl_second_attack_point;
   int owl_defense_point;
   int owl_defense_code;
@@ -607 +619 @@
 @quotation
 The dragon number, used as a key into the @code{dragon2} array.
 @end quotation
-@item origin
+@item @code{origin}
 @cindex dragon origin
 @quotation
 The origin of the dragon is a unique particular vertex
@@ -616 +628 @@
 copied to the dragon origins. Amalgamation of two dragons
 amounts to changing the origin of one.
 @end quotation
-@item size
+@item @code{size}
 @cindex dragon size
 @quotation
 The number of stones in the dragon.
 @end quotation
-@item effective size
+@item @code{effective size}
 @cindex effective size
 @quotation
 The sum of the effective sizes of the constituent worms.
@@ -630 +642 @@
 cardinality of the dragon plus the number of empty vertices which are
 nearer this dragon than any other.
 @end quotation
-@item crude_status
+@item @code{crude_status}
 @quotation
 (ALIVE, DEAD, UNKNOWN, CRITICAL). An early measure of the life
 potential of the dragon. It is computed before the owl code is
 run and is superceded by the status as soon as that becomes
 available.
 @end quotation
-@item status
+@item @code{status}
 @cindex dragon status
 @quotation
 The dragon status is the best measure of the dragon's health.
@@ -649 +661 @@
 Here are definitions of the fields in the @code{dragon2} array.
 
 @itemize @bullet
-@item origin
+@item @code{origin}
 @quotation
 The origin field is duplicated here.
 @end quotation
-@item adjacent
 @item @code{adjacent[MAX_NEIGHBOR_DRAGONS]}
-@cindex neighbor dragons
-@cindex adjacent dragons
-@findex find_neighbor_dragons
-@quotation
-Dragons of either color near the given one are called @dfn{neighbors}.
-They are computed by the function @code{find_neighbor_dragons()}.
-The @code{dragon2.adjacent} array gives the dragon numbers of
-these dragons.
-@end quotation
 @item @code{neighbors}
 @cindex neighbor dragons
 @cindex adjacent dragons
@@ -671 +673 @@
 @quotation
 Dragons of either color near the given one are called @dfn{neighbors}.
 They are computed by the function @code{find_neighbor_dragons()}.
-The @code{dragon2.adjacent} array gives the dragon numbers of
-these dragons.
+The @code{adjacent} array gives the dragon numbers of
+these dragons and @code{neighbors} gives the number of them.
 @end quotation
-@item neighbors
-@quotation
-The number of neighbor dragons.
-@end quotation
-@item hostile_neighbors
+@item @code{hostile_neighbors}
 @quotation
 The number of neighbor dragons of the opposite color.
 @end quotation
-@item moyo_size
-@item float moyo_territorial_value
+@item @code{moyo_size}
+@item @code{moyo_territorial_value}
 @findex compute_surrounding_moyo_sizes
 @quotation
 The function @code{compute_surrounding_moyo_sizes()} assigns
@@ -691 +689 @@
 each dragon (@pxref{Territory and Moyo}). This is the 
 moyo size. They are recorded in these fields.
 @end quotation
-@item safety
+@item @code{safety}
 @cindex dragon safety
 @quotation
 The dragon safety can take on one of the values
@@ -707 +705 @@
 @item INESSENTIAL - the dragon is unimportant (e.g. nakade stones) and dead
 @end itemize
 @end quotation
-@item weakness
-@item weakness_pre_owl
+@item @code{weakness}
+@item @code{weakness_pre_owl}
 @cindex dragon weakness
 @cindex weakness
 @quotation
@@ -717 +715 @@
 dragons in greater need of safety. The field @code{weakness_pre_owl}
 is a preliminary computation before the owl code is run.
 @end quotation
-@item escape_route
+@item @code{strategic_size}
+@cindex strategic_size
+@quotation
+An effective size including weakness of neighbors.
+@end quotation
+@item @code{escape_route}
 @cindex dragon escape_route
 @cindex escape_route
 @findex compute_escape
@@ -726 +729 @@
 in case it cannot make two eyes locally. Documentation
 may be found in @ref{Escape}.
 @end quotation
-@item struct eyevalue genus
+@item @code{genus}
 @cindex dragon genus
 @cindex genus
 @quotation
@@ -744 +747 @@
 
 @end example
 @end quotation
-@item heye
+@item @code{heye}
 @quotation
 Location of a half eye attached to the dragon.
 @end quotation
-@item lunch
+@item @code{lunch}
 @cindex dragon lunch
 @cindex lunch
 @quotation
@@ -756 +759 @@
 can be captured. In contrast with worm lunches, a dragon
 lunch must be able to defend itself.
 @end quotation
-@item surround_status
-@item surround_size
+@item @code{surround_status}
+@item @code{surround_size}
 @cindex surround_status
 @cindex surround_size
 @cindex surround
@@ -766 +769 @@
 it is @dfn{surrounded}. See @ref{Surrounded Dragons} and
 the comments in @file{surround.c} for more information about the
 algorithm.  Used in computing the escape_route, and also callable
-from patterns (currently used by CB258).  
+from patterns.  
 @end quotation
-@item semeais
-@item semeai_defense_point
-@item semeai_defense_certain
-@item semeai_attack_point
-@item semeai_attack_certain
-@cindex semeai
+@item @code{semeais}
+@item @code{semeai_defense_code}
+@item @code{semeai_defense_point}
+@item @code{semeai_defense_certain}
+@item @code{semeai_defense_target}
+@item @code{semeai_attack_code}
+@item @code{semeai_attack_point}
+@item @code{semeai_attack_certain}
+@item @code{semeai_attack_target}
+@cindex semeais
+@cindex semeai_defense_code
 @cindex semeai_defense_point
 @cindex semeai_defense_certain
+@cindex semeai_defense_target
+@cindex semeai_attack_code
 @cindex semeai_attack_point
 @cindex semeai_attack_certain
+@cindex semeai_attack_target
 @quotation
 If two dragons of opposite color both have the status CRITICAL
 or DEAD they are in a @dfn{semeai} (capturing race), and their
@@ -785 +796 @@
 @code{owl_analyze_semeai()} in @file{owl.c}, which attempts to
 determine which is alive, which dead, or if the result is
 seki, and whether it is important who moves first. The
-function @file{new_semeai()} in @file{semeai.c} attempts
+function @code{semeai()} in @file{semeai.c} attempts
 to revise the statuses and to generate move reasons based
 on these results. The field @code{dragon2.semeais} is nonzero
 if the dragon is an element of a semeai, and equals the
 number of semeais (seldom more than one). The semeai defense
 and attack points are locations the defender or attacker
-must move to win the semeai. The field @code{semeai_margin_of_safety}
-is intended to indicate whether the semeai is close or not
-but currently this field is not maintained. The fields
+must move to win the semeai and the result code of these moves is
+also stored. In @code{semeai_defense_target} and
+@code{semeai_attack_target} an origin of an opponent dragon in
+semeai, on which the move has impact, is stored. The fields
 @code{semeai_defense_certain} and @code{semeai_attack_certain}
 indicate that the semeai code was able to finish analysis
 without running out of nodes.
 @end quotation
-@item owl_status
+@item @code{owl_threat_status}
+@quotation
+Informs, whether the dragon has any defense or attack threats
+(@code{CAN_THREATEN_ATTACK} or @code{CAN_THREATEN_DEFENSE}).
+@end quotation
+@item @code{owl_status}
 @quotation
 This is a classification similar to @code{dragon.crude_status}, but
 based on the life and death reading in @file{owl.c}.
@@ -810 +827 @@
 @code{owl_defend()} is run, and if it can be defended it
 is classified as @code{CRITICAL}, and if not, as @code{DEAD}.
 @end quotation
-@item owl_attack_point
+@item @code{owl_attack_point}
 @cindex owl_attack_point
 @quotation
 If the dragon can be attacked this is the point to attack the dragon.
 @end quotation
-@item owl_attack_code
+@item @code{owl_attack_code}
 @cindex owl_attack_code
 @quotation
-The owl attack code, It can be WIN, KO_A, KO_B or 0 (@pxref{Return Codes}).
+The owl attack code, It can be WIN, KO_A, GAIN, LOSS,
+KO_B or 0 (@pxref{Return Codes}).
 @end quotation
-@item owl_attack_certain
+@item @code{owl_attack_certain}
 @cindex owl_attack_certain
 @quotation
 The owl reading is able to finish analyzing the attack
 without running out of nodes.
 @end quotation
-@item owl_second_attack_point
+@item @code{owl_attack_node_count}
+@cindex owl_attack_node_count
+@quotation
+Number of nodes used during analyze of attack move.
+@end quotation
+@item @code{owl_second_attack_point}
 @cindex owl_second_attack_point
 @quotation
 A second attack point.
 @end quotation
-@item owl_defense_point
+@item @code{owl_defense_point}
 @cindex owl_defense_point
 @quotation
 If the dragon can be defended, this is the place to play.
 @end quotation
-@item owl_defense_code
+@item @code{owl_defense_code}
 @cindex owl_defense_code
 @quotation
-The owl defense code, It can be WIN, KO_A, KO_B or 0 (@pxref{Return Codes}).
+The owl defense code, It can be WIN, KO_A, GAIN, LOSS,
+KO_B or 0 (@pxref{Return Codes}).
 @end quotation
-@item owl_defense_certain
+@item @code{owl_defense_certain}
 @cindex owl_defense_certain
 @quotation
 The owl code is able to finish analyzing the defense without
 running out of nodes.
 @end quotation
-@item owl_second_defense_point
+@item @code{owl_second_defense_point}
 @cindex owl_second_defense_point
 @quotation
 A second owl defense point.
 @end quotation
+@item @code{owl_attack_kworm}
+@cindex owl_attack_kworm
+@quotation
+Position of a worm, which can be killed during attack on the dragon
+(@code{owl_attack_code} has to be @code{GAIN}).
+@end quotation
+@item @code{owl_defense_kworm}
+@cindex owl_defense_kworm
+@quotation
+Position of our worm (part of the dragon) abandoned during defense of
+the dragon (@code{owl_defend_code} has to be @code{LOSS}).
+@end quotation
 @end itemize
 
 @node Dragons in Color

doc/move_generation.texi

@@ -214 +214 @@
 the simultaneous attack of one worm and the defense of another. As for
 attack and defense moves, it's important that all moves which win a
 semeai are found, so an informed choice can be made between them.
+Semeai move reasons are set by the semeai module.
+
+One might also wish to list moves which increase the lead in a semeai
+race (removes ko threats) for use as secondary move reasons. Analogously,
+if we are behind in the race. However this has not been implemented yet.
 
-Semeai move reasons should be set by the semeai module. However this
-has not been implemented yet. One might also wish to list moves
-which increase the lead in a semeai race (removes ko threats) for use
-as secondary move reasons. Analogously if we are behind in the race.
 
 @node  Making eyes
 @subsection Making or destroying eyes
@@ -229 +230 @@
 will be valued substantially higher if this is the case. As usual it's
 important to find all moves that change the eye count.
 
-(This is part of what eye_finder was doing. Currently it only finds
-one vital point for each unstable eye space.)
+The eye module (@file{optics.c}) is handling this. It uses eyes patterns
+database @file{patterns/eyes.db}.
 
 @node  Antisuji moves
 @subsection Antisuji moves
@@ -247 +248 @@
 territory move reason. That move reason is added by the @samp{e}
 patterns in @file{patterns/patterns.db}. Similarly the @samp{E} patterns
 attempt to generate or mitigate a moyo, which is a region of influence
-not yet secure territory, yet valuable. Such a pattern sets the ``expand
-moyo'' move reason.
+not yet secure territory, yet valuable. There are also other patterns for
+reducing territory, invasions and making bariers (to defend before
+invasions) - they are in @file{patterns/influence.db} and
+@file{patterns/barriers.db}. These patterns set the ``expand moyo'',
+``expand territory'' and ``invasion'' move reasons. They also have
+influence on a move territorial valuation.
 
 @node Owl attack and defense
 @subsection Attacking and Defending Dragons
@@ -310 +315 @@
 as explained for example in @emph{The Endgame} by Ogawa
 and Davies.
 
-Moves are valued with respect to four different criteria. These are
+Moves are valued with respect to four different main criteria. These
+are
 
 @itemize @bullet
 @item territorial value
@@ -362 +368 @@
 * Minimum Value::                 Minimum value
 * Secondary Value::               Other, more indirect, gains from a move
 * Threats and Followup Value::    Valuation of attack and defense threats
+* Additional ko value::    Additional threat value for a ko fight
 @end menu
 
 @node Territorial value
@@ -384 +391 @@
 
 @node Strategical value
 @subsection Strategical Value
+@findex estimate_strategical_value
 
 Strategical defense or attack reasons are assigned to any move
 which matches a pattern of type @samp{a} or @samp{d}. These are
@@ -394 +402 @@
 to check its status or safety. This is done later, during
 the valuation phase.
 
+The whole algorithm is placed in @code{estimate_strategical_value}.
+
 @node Shape factor
 @subsection Shape Factor
 
@@ -451 +461 @@
 which we cannot legally take, then such a move becomes attractive as a ko
 threat and the full followup value is taken into account.
 
+@node Additional ko value
+@subsection Additional ko value
+
+Some moves give us additional threats and some give them to an opponent.
+In such situations we should give some bonus or penalty for creating ko
+threats. As for now only positive contribution is counted.
+
 @node End Game
 @section End Game
 

doc/patterns.texi

@@ -85 +85 @@
 Elements are not generated for @samp{?} markers, but they are not
 completely ignored - see below.
         
-The line beginning @samp{:} describes various attributes of the pattern, such
-as its symmetry and its class. Optionally, a function called a
-``helper'' can be provided to assist the matcher in deciding whether
-to accept move. Most patterns do not require a helper, and this field
-is filled with NULL.
-
 @findex shapes_callback
 The matcher in @file{matchpat.c} searches the board for places where this
 layout appears on the board, and the callback function
@@ -100 +94 @@
 After the pattern, there is some supplementary information in the format:
 @example
 
-  :trfno, classification, [values], helper_function
+  :trfno, attributes, [values], helper_function
 
 @end example
 
@@ -110 +104 @@
 represents the axis of symmetry. (E.g. @samp{|} means symmetrical about a
 vertical axis.)
 
+@code{helper_function} is a function that can be provided to assist the matcher
+in deciding whether to accept move. Most patterns do not require a helper,
+and this field is filled with NULL.
+
 The above pattern could equally well be written on the left edge:
 
 @example
@@ -127 +125 @@
 way, or for that matter, on the top or right edges, or in any
 of the four corners. As a matter of convention all the edge patterns 
 in @file{patterns.db} are written on the bottom edge or in the lower left
-corners. In the @file{patterns/} directory there is a program called
-@code{transpat} which can rotate or otherwise transpose patterns.
-This program is not built by default---if you think you need it,
-@code{make transpat} in the @file{patterns/} directory and
-consult the usage remarks at the beginning of @file{patterns/transpat.c}.
+corners.
 
 @node  Pattern Classification
 @section Pattern Attributes
@@ -415 +409 @@
 need to remove the stones we placed from the reading stack. This is done
 with the function @code{popgo()}.
 
+IMPORTANT: The macro @code{OFFSET} is not used anymore, because it has
+fixed coordinates and patterns can be now rotated randomly by DFA
+optimizer. All helpers that require usage of this macro have to be moved
+to autohelpers.
+
 @node  Autohelpers and Constraints
 @section Autohelpers and Constraints
 
@@ -566 +565 @@
 The autohelper functions are translated into C code by the program in
 @file{mkpat.c}. To see exactly how the functions are implemented,
 consult the autohelper function definitions in that file. Autohelper
-functions can be used in both constraint and action lines.
+functions can be used in both constraint and action lines. Here is
+a partial list of them:
 
 @example
 
@@ -1063 +1063 @@
 
 The patterns in @file{conn.db} are used for helping @code{make_dragons()}
 amalgamate worms into dragons and to some extent for modifying eye spaces.
-The patterns in this database use the classifications @samp{B}, 
-@samp{C}, and @samp{e}. @samp{B} patterns are used for finding cutting points,
+The patterns in this database use the classifications @samp{B} and 
+@samp{C}. @samp{B} patterns are used for finding cutting points,
 where amalgamation should not be performed, @samp{C} patterns are used for
-finding existing connections, over which amalgamation is to be done, and 
-@samp{e} patterns are used for modifying eye spaces and reevaluating lunches.
+finding existing connections, over which amalgamation is to be done.
 There are also some patterns without classification, which use action lines to
 have an impact. These are matched together with the @samp{C} patterns. Further
 details and examples can be found in @xref{Worms and Dragons}.
@@ -1181 +1180 @@
 @findex find_connections
 @quotation 
 Find explicit connection patterns and amalgamate the involved dragons.
-This goes through the connection database consulting patterns except those of
-type B, E or e. When such a function is found, the function
+This goes through the connection database consulting only patterns of type C.
+When such a function is found, the function
 @code{cut_connect_callback} is invoked.
 @end quotation
-@item void modify_eye_spaces1(void)
-@findex modify_eye_spaces1
-@quotation 
-Find explicit connection patterns and amalgamate the involved dragons.
-This goes through the connection database consulting only patterns
-of type E (@pxref{Connections Database}). When such a function is found, the
-function @code{cut_connect_callback} is invoked.  
-@end quotation
-@item void modify_eye_spaces1(void)
-@findex modify_eye_spaces1
-@quotation 
-Find explicit connection patterns and amalgamate the involved dragons.
-This goes through the connection database consulting only patterns
-of type e (@pxref{Connections Database}). When such a function is found, the
-function @code{cut_connect_callback} is invoked.  
-@end quotation
 @end itemize
 
 @node  Tuning

doc/reading.texi

@@ -66 +66 @@
 
 The function @code{do_attack} and @code{do_find_defense} are wrappers
 themselves and call @code{attack1}, @code{attack2}, @code{attack3} or
-@code{attack4} resp.  @code{defend1}, @code{defend1}, @code{defend1}