<s>
In	O
computer	B-Application
chess	I-Application
,	O
and	O
in	O
other	O
games	O
that	O
computers	O
play	O
,	O
late	B-Algorithm
move	I-Algorithm
reductions	I-Algorithm
is	O
a	O
non-game-specific	O
enhancement	O
to	O
the	O
alpha	B-Algorithm
–	I-Algorithm
beta	I-Algorithm
algorithm	I-Algorithm
and	O
its	O
variants	O
which	O
attempts	O
to	O
examine	O
a	O
game	O
search	O
tree	O
more	O
efficiently	O
.	O
</s>
<s>
In	O
games	O
like	O
chess	B-Application
,	O
most	O
programs	B-Application
search	O
winning	O
captures	O
and	O
"	O
killer	B-Algorithm
moves	I-Algorithm
"	O
first	O
.	O
</s>
<s>
Late	B-Algorithm
move	I-Algorithm
reductions	I-Algorithm
will	O
reduce	O
the	O
search	O
depth	O
for	O
moves	O
searched	O
later	O
at	O
a	O
given	O
node	O
.	O
</s>
<s>
Most	O
chess	B-Application
programs	B-Application
will	O
search	O
the	O
first	O
several	O
moves	O
at	O
a	O
node	O
to	O
full	O
depth	O
.	O
</s>
