  We present new almost time-reversible integrators for solution of planetary
systems consisting of "planets" and a dominant mass ("star"). The algorithms
can be considered adaptive generalizations of the Wisdom--Holman method, in
which all pairs of planets can be assigned timesteps. These timesteps, along
with the global timestep, can be adapted time-reversibly, often at no
appreciable additional compute cost, without sacrificing any of the long-term
error benefits of the Wisdom--Holman method. The method can also be considered
a simpler and more flexible version of the \texttt{SYMBA} symplectic code. We
perform tests on several challenging problems with close encounters and find
the reversible algorithms are up to $2.6$ times faster than a code based on
\texttt{SYMBA}. The codes presented here are available on Github. We also find
adapting a global timestep reversibly and discretely must be done in
block-synchronized manner or similar.
