Session W18: Theoretical Methods and Algorithms
2:30 PM–5:18 PM, Thursday, March 8, 2007
Colorado Convention Center Room: 103
Sponsoring Unit:
DCP
Chair: Anne Chaka, National Institute of Standards and Technology
Abstract ID: BAPS.2007.MAR.W18.7
Abstract: W18.00007 : What decides if a smarter army can win a battle?
3:42 PM–3:54 PM
Preview Abstract
MathJax On | Off 
Abstract 
Authors:
Linda Shanahan
(State Univ of New York at Buffalo)
Surajit Sen
(State University of New York at Buffalo)
We study the kinetics associated with a ``war'' in which an attacking army attempts to win over a spatially dispersed defender on a 2D lattice. The levels of engagement are comparable in our study. The conflicting parties can annihilate, win or lose at any given site depending upon certain preselected rules of engagement. The attacker possesses higher intelligence, which is manifested through the moves of the attackers. We show that an ``intelligent'' attacker with subcritical number of attackers cannot win in the engagement.
To cite this abstract, use the following reference: http://meetings.aps.org/link/BAPS.2007.MAR.W18.7