<s>
In	O
the	O
game	O
Go	O
,	O
Benson	B-Application
's	I-Application
algorithm	I-Application
(	O
named	O
after	O
David	O
B	O
.	O
Benson	O
)	O
can	O
be	O
used	O
to	O
determine	O
the	O
stones	O
which	O
are	O
safe	O
from	O
capture	O
no	O
matter	O
how	O
many	O
turns	O
in	O
a	O
row	O
the	O
opposing	O
player	O
gets	O
,	O
i.e.	O
</s>
<s>
Without	O
loss	O
of	O
generality	O
,	O
we	O
describe	O
Benson	B-Application
's	I-Application
algorithm	I-Application
for	O
the	O
Black	O
player	O
.	O
</s>
<s>
Then	O
Benson	B-Application
's	I-Application
algorithm	I-Application
requires	O
iteratively	O
applying	O
the	O
following	O
two	O
steps	O
until	O
neither	O
is	O
able	O
to	O
remove	O
any	O
more	O
chains	O
or	O
regions	O
:	O
</s>
<s>
Most	O
strong	O
Computer	B-Application
Go	I-Application
programs	O
since	O
2008	O
do	O
not	O
actually	O
use	O
Benson	B-Application
's	I-Application
algorithm	I-Application
.	O
</s>
