In solving any unique-solution "non-basic" sudoku, eventually there will be a "last non-basic stage" such that the next candidate elimination leaves only naked/hidden singles. I'm looking for puzzles with a solution-path such that the last non-basic stage has as few unsolved cells as possible (i.e. the number of singles in the "end-game" is a minimum). If puzzles tie at this number, those that further minimize the total number of candidates in the last non-basic stage are preferred.

Could anyone please post a puzzle or two that they believe might be at this minimum?