This talk will evaluate the challenges and best practices associated with the Markov bases approach for sampling lattice points in a polytope. We will discuss scaling and sparsity issues when applying Markov bases to real data. As a cautionary tale, we will present a way to generalize simple-switch Markov chains to colored graphs. The talk will include several "good news" and "bad news" theorems.