We combinatorialize tame knots using stick presentations, then form knot diagrams by taking regular projections onto a plane.  I explain two ways to convert a word in the generators of Artin's braid group into a knot diagram, namely bridge diagrams or trace (Markov) closures.   Triangle moves, Reidemeister moves, and Markov moves give us elementary ways to decide when two presentations of a knot (in the respective types) represent equivalent knots.