Okay, I’m nowhere near an expert in math or computer science. I am just curious.

The Graph Theory I’m talking about is more relevant to Computer Science.

Take a 60 card deck as 60 **vertices** (or nodes). Some cards, such as ultra ball, can retrieve other specific cards, like shaymin EX. Some draw any random card. Some dicard cards, and others take cards from the dicard pile.

Those connections between cards are **edges**, and groups of edges form **paths**. Edges can be represented in matrices, which can be taken to the nth power to find paths of length n.

Basically, using this logic of paths, you can find how well your deck flows together, the **overall consistency** of your deck. I’ve read articles on the first turn hand probability, but in this VS seeker, Battle Compressor, Shaymin EX, Trainers Mail and Delinquent format, that is not as important as the consistency of your hand.

Does anyone know a way to apply this? Again, I’m no expert on the subject, I’m just asking.