Show that the number of tame knot types is at most countable. Show that the number of tame knot types is at most countable. I want a hint for solving this problem please.

**Hint:** Tame knots are represented by finite closed chains of polygons (Whether this is a hint depends on your defintion of tame knots though).