<s>
Its	O
main	O
advantage	O
over	O
the	O
earlier	O
Stromquist	B-Algorithm
moving-knives	I-Algorithm
procedure	I-Algorithm
is	O
that	O
it	O
requires	O
only	O
two	O
moving	O
knives	O
,	O
instead	O
of	O
four	O
.	O
</s>
<s>
The	O
earlier	O
Robertson	B-Algorithm
–	I-Algorithm
Webb	I-Algorithm
rotating-knife	I-Algorithm
procedure	I-Algorithm
requires	O
only	O
one	O
moving	O
knife	O
,	O
but	O
it	O
works	O
only	O
for	O
a	O
two-dimensional	O
cake	O
,	O
while	O
the	O
Barbanel	O
–	O
Brams	O
procedure	O
works	O
also	O
for	O
a	O
one-dimensional	O
cake	O
.	O
</s>
<s>
The	O
procedure	O
can	O
be	O
adapted	O
for	O
chore	B-Algorithm
division	I-Algorithm
-	O
dividing	O
a	O
cake	O
with	O
a	O
negative	O
value	O
:	O
in	O
the	O
initial	O
step	O
the	O
rightmost	O
cut	O
should	O
be	O
selected	O
instead	O
of	O
the	O
leftmost	O
cut	O
,	O
and	O
in	O
the	O
following	O
steps	O
the	O
directions	O
of	O
movement	O
should	O
be	O
adapted	O
such	O
that	O
the	O
desired	O
piece	O
grows	O
instead	O
of	O
shrinking	O
.	O
</s>
