Section 5.5.5 of the fourth edition mentions that SMA* is available:
The complete algorithm is described in the online code repository accompanying this book. There is one subtlety worth mentioning. We said that SMA∗ expands the best leaf and deletes the worst leaf.
But I can’t find it.
Section 5.5.5 of the fourth edition mentions that SMA* is available:
But I can’t find it.