<s>
Collaborative	B-Algorithm
Diffusion	I-Algorithm
is	O
a	O
type	O
of	O
pathfinding	B-Algorithm
algorithm	O
which	O
uses	O
the	O
concept	O
of	O
antiobjects	O
,	O
objects	O
within	O
a	O
computer	O
program	O
that	O
function	O
opposite	O
to	O
what	O
would	O
be	O
conventionally	O
expected	O
.	O
</s>
<s>
Collaborative	B-Algorithm
Diffusion	I-Algorithm
is	O
typically	O
used	O
in	O
video	O
games	O
,	O
when	O
multiple	O
agents	O
must	O
path	O
towards	O
a	O
single	O
target	O
agent	O
.	O
</s>
<s>
For	O
example	O
,	O
the	O
ghosts	O
in	O
Pac-Man	B-Application
.	O
</s>
<s>
In	O
this	O
case	O
,	O
the	O
background	O
tiles	O
serve	O
as	O
antiobjects	O
,	O
carrying	O
out	O
the	O
necessary	O
calculations	O
for	O
creating	O
a	O
path	O
and	O
having	O
the	O
foreground	O
objects	O
react	O
accordingly	O
,	O
whereas	O
having	O
foreground	O
objects	O
be	O
responsible	O
for	O
their	O
own	O
pathing	B-Algorithm
would	O
be	O
conventionally	O
expected	O
.	O
</s>
<s>
Collaborative	B-Algorithm
Diffusion	I-Algorithm
is	O
favored	O
for	O
its	O
efficiency	O
over	O
other	O
pathfinding	B-Algorithm
algorithms	O
,	O
such	O
as	O
A*	B-Protocol
,	O
when	O
handling	O
multiple	O
agents	O
.	O
</s>
