a grid poset -- or "grid" for short -- is a product of chains. we ask, what does a random linear extension of a grid look like? in particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in a linear extension are incomparable in the poset, is close to its maximum possible value. the techniques employed rely on entropy arguments. we mention several interesting questions about this wide-open area.