On Strategy I

"It is possible to learn strategic flexibility [...] however, that it is difficult to teach it. It is not a matter of learning a few readily grasped general principles, but of learning a lot of small, 'local' rules, each of which is applicable in a limited area. The point is not to learn how to drive a steamroller with which one can flatten all problems in the same way, but to learn the adroitness of a puppeteer, who at one time holds many strings in his hands and who is able to adapt his movements to the given circumstances in the most sophisticated ways." (Dietrich Dörner, "The Logic of Failure", Philosophical Transactions of the Royal Society of London (B), 1990)

"[…] a rule for choosing an action is termed a strategy. If the rule says to always take the same action, it's called a pure strategy; otherwise, the strategy is called mixed. A solution to a game is simply a strategy for each player that gives each of them the best possible payoff, in the sense of being a regret-free choice." (John L Casti, "Five Golden Rules", 1995)

"So the strategy of mixing the choices with equal likelihood is an equilibrium point for the game, in the same sense that the minimax point is an equilibrium for a game having a saddle point. Thus, using a strategy that randomizes their choices, Max and Min can each announce his or her strategy to the other without the opponent being able to exploit this information to get a larger average payoff for himself or herself." (John L Casti, "Five Golden Rules", 1995)

"A strategy is usually expressed by a set of heuristic rules. The heuristic rules ease the process of searching for an optimal solution. The process is usually iterative and at one step either the global optimum for the whole problem (state) space is found and the process stops, or a local optimum for a subspace of the state space of the problem is found and the problem continues, if it is possible to improve." (Nikola K Kasabov, "Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering", 1996)

"Strategy in complex systems must resemble strategy in board games. You develop a small and useful tree of options that is continuously revised based on the arrangement of pieces and the actions of your opponent. It is critical to keep the number of options open. It is important to develop a theory of what kinds of options you want to have open." (John H Holland, [presentation] 2000)

"[...] a general-purpose universal optimization strategy is theoretically impossible, and the only way one strategy can outperform another is if it is specialized to the specific problem under consideration." Yu-Chi Ho & David L Pepyne, "Simple explanation of the no-free-lunch theorem and its implications", Journal of Optimization Theory and Applications 115, 2002)

"[...] the System may be so thoroughly organized around the familiar response strategy that a new response would require extensive restructuring - something that Systems do with the greatest reluctance and difficulty." (John Gall, "Systemantics: The Systems Bible", 2002)

"We can find the minimax strategy by exploiting the game’s symmetry. Roughly speaking, the minimax strategy must have the same kind of symmetry." (Ian Stewart, "Symmetry: A Very Short Introduction", 2013)

"A heuristic is a strategy we derive from previous experience with a similar problem." (Darius Foroux, "Think Straight", 2017)