Information Technology Reference
In-Depth Information
Fig. 16.1
Hider's expectation of number of cells remaining (
K
=
2,
L
=
∞
)
The numerical results will be discussed slightly further in the next section.
16.7 Numerical Results and Conjectures
We start by presenting a conjecture concerning the value of the game in the case
where
L
is infinite.
Conjecture 1
The value of the silent discrete search-ambush game for finite
K
,
L
=
∞
, satisfies:
1
T
∞
,
K
≥
K
,
(16.35)
−
σ
1
where
σ
K
is the unique real solution between 0 and 1 to the polynomial:
K
i
=
1
x
i
K
2
=
−
0
,
(16.36)
It should be noted that an earlier version of this conjecture had an equality in
place of this inequality; however, further numerical investigation has made that
possibility seem less likely. The equality does hold, at least, for the cases of
K
=
1
Search WWH ::
Custom Search