The (multi)degree of a projective variety is a generalization of the ordinary degree of a polynomial. In this talk, we will describe an algorithm generating hieroglyphic tablets from which one can read off the multidegree of an arbitrary projective variety. In the latter portion of the talk, we will give several examples showing how this algorithm can lead one to guess several beautiful theorems in algebraic combinatorics.
