Can anyone explain how look-up tables are used for optimal Rubik's cube solvers such as Thistlethwaite's or Kociemba?

Question

I have implemented Thistlethwaite\'s algorithm however, it is far too slow as it is only using graph traversal over many Rubik\'s cube states. I am currently unsure of how l