<s>
Kotok-McCarthy	B-Application
also	O
known	O
as	O
A	O
Chess	B-Application
Playing	O
Program	O
for	O
the	O
IBM	B-Device
7090	I-Device
Computer	O
was	O
the	O
first	O
computer	B-Application
program	I-Application
to	I-Application
play	I-Application
chess	I-Application
convincingly	O
.	O
</s>
<s>
It	O
is	O
also	O
remembered	O
because	O
it	O
played	O
in	O
and	O
lost	O
the	O
first	O
chess	B-Application
match	O
between	O
two	O
computer	O
programs	O
.	O
</s>
<s>
Building	O
on	O
Alex	O
Bernstein	O
's	O
landmark	O
1957	O
program	O
created	O
at	O
IBM	O
and	O
on	O
IBM	B-Device
704	I-Device
routines	O
by	O
McCarthy	O
and	O
Paul	O
W	O
.	O
Abrahams	O
,	O
they	O
added	O
alpha-beta	B-Algorithm
pruning	I-Algorithm
to	O
minmax	B-Algorithm
at	O
McCarthy	O
's	O
suggestion	O
to	O
improve	O
the	O
plausible	O
move	O
generator	O
.	O
</s>
<s>
They	O
wrote	O
in	O
Fortran	B-Application
and	O
FAP	O
on	O
scavenged	O
computer	O
time	O
.	O
</s>
<s>
After	O
MIT	O
received	O
a	O
7090	B-Device
from	O
IBM	O
,	O
a	O
single	O
move	O
took	O
five	O
to	O
twenty	O
minutes	O
.	O
</s>
<s>
Kronrod	O
considered	O
Kotok-McCarthy	B-Application
to	O
be	O
the	O
best	O
program	O
in	O
the	O
United	O
States	O
at	O
the	O
time	O
.	O
</s>
<s>
Although	O
some	O
of	O
its	O
faults	O
were	O
known	O
in	O
1965	O
and	O
were	O
corrected	O
in	O
the	O
Greenblatt	B-Application
program	I-Application
at	O
MIT	O
Project	O
MAC	O
,	O
Kotok-McCarthy	B-Application
was	O
no	O
longer	O
in	O
development	O
and	O
was	O
three	O
years	O
out	O
of	O
date	O
.	O
</s>
<s>
The	O
Kotok-McCarthy	B-Application
program	O
lost	O
the	O
match	O
by	O
a	O
score	O
of	O
three	O
to	O
one	O
and	O
the	O
first	O
two	O
games	O
were	O
played	O
with	O
a	O
weak	O
version	O
.	O
</s>
<s>
The	O
ITEP	O
group	O
was	O
advised	O
by	O
Russian	O
chess	B-Application
master	O
Alexander	O
R	O
.	O
Bitman	O
and	O
three-time	O
world	O
champion	O
Mikhail	O
Botvinnik	O
.	O
</s>
<s>
In	O
1967	O
Mac	B-Application
Hack	I-Application
VI	I-Application
by	O
Richard	O
Greenblatt	O
with	O
Donald	O
E	O
.	O
Eastlake	O
III	O
became	O
an	O
honorary	O
member	O
of	O
the	O
United	O
States	O
Chess	B-Application
Federation	O
when	O
a	O
person	O
lost	O
to	O
it	O
in	O
tournament	O
play	O
in	O
Massachusetts	O
.	O
</s>
<s>
Mikhail	O
Donskoy	O
,	O
Arlazarov	O
and	O
Uskov	O
developed	O
the	O
ITEP	O
program	O
into	O
Kaissa	O
at	O
the	O
and	O
in	O
1974	O
,	O
it	O
became	O
the	O
world	O
computer	B-Application
chess	I-Application
champion	O
.	O
</s>
<s>
Debate	O
continued	O
some	O
forty	O
years	O
after	O
the	O
first	O
test	O
,	O
about	O
whether	O
the	O
Shannon	O
Type	O
A	O
brute	O
force	O
approach	O
,	O
used	O
by	O
ITEP	O
,	O
is	O
superior	O
to	O
the	O
Type	O
B	O
selective	O
strategy	O
,	O
used	O
by	O
Kotok-McCarthy	B-Application
.	O
</s>
<s>
The	O
success	O
of	O
programs	O
such	O
as	O
Northwestern	O
University	O
's	O
Chess	B-Application
4.5	O
,	O
which	O
used	O
the	O
Type	O
A	O
strategy	O
,	O
however	O
,	O
led	O
to	O
the	O
Type	O
A	O
strategy	O
being	O
favored	O
,	O
at	O
least	O
for	O
projects	O
where	O
playing	O
strength	O
,	O
and	O
not	O
insight	O
into	O
human	O
thought	O
processes	O
,	O
was	O
the	O
goal	O
.	O
</s>
<s>
Recently	O
,	O
however	O
,	O
chess	B-Application
programs	O
which	O
make	O
use	O
of	O
neural	O
networks	O
to	O
evaluate	O
positions	O
,	O
such	O
as	O
Giraffe	O
,	O
Alpha	B-Application
Chess	I-Application
Zero	I-Application
and	O
Leela	B-Application
Chess	I-Application
Zero	I-Application
,	O
make	O
use	O
of	O
Monte	B-Application
Carlo	I-Application
Tree	I-Application
Search	I-Application
in	O
order	O
to	O
allow	O
a	O
deeper	O
search	O
by	O
not	O
evaluating	O
every	O
position	O
.	O
</s>
