Cats can work out mathematically the exact place to sit that will cause most inconvenience. Cats can perform the combinatorial optimization problem of maximizing inconvenience between the chosen locations and the locations which are not selected. The problem of finding the configuration that maximizes inconvenience among a exponentially large number of candidate solutions is NP-complete. Future work on cat metaheuristics will review which algorithms are being used in polynomial time with a constant cat approximation ratio.