I will explain the plethora of combinatorial objects used to describe cluster structures on Grassmannians, such as plabic graphs, alternating strand diagrams, maximal weakly separated collections and plabic tilings. I will emphasize computational challenges, both ones which are theoretically routine but would be incredibly useful to implement, and those which require new ideas.