We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n?1n?1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n?1n?1.
