Copied from description:
Erik Akkersdijk introduced the idea of solving 3 cross pairs after the first two centres, then finishing the centres without destroying the 3 cross pairs. Someone (possibly Syuhei Omura I'm not sure) discovered a way of pairing 3 edges after the centres by doing d, replace 3 edges, then do d'. Chris Hardwick invented an edge pairing method called "2 pair chain solving".
What I have done is combined all three to create this method of solving the centres + edges + cross.
17/10/09 EDIT: Here's a video tutorial with annotations:
Last edited by a moderator: