Is there a good source which thoroughly goes through floating buffers? I've searched but haven't really found one that satisfied me.

This is my understanding for centers: You start with a buffer on U, and memorize normally until you get to a center that belongs on U. If you have an even number of targets, then you can just switch to the next buffer and start over again, doing this until the fourth buffer is solved.

If you had an odd number of targets at the end of a buffer, what are the most common ways to deal with this? One way I saw is to add a 2-cycle at the end, but what if you can't find a 2-cycle of centers?

If you solve the fourth buffer but the centers aren't done, would you just continue breaking into cycles on the fourth buffer, or switch back to your first buffer?

For wings, how would all of these differ? It seems like you can't just add a 2-cycle of wings very easily.