An online problem is homoscopic if, no matter what decision you make, the future input data you receive are the same. For example, suppose your cache consists of pages a and b, and the next two requests are c and a. Whether you eject a or b after the first request, you will get the same input, namely "a" for the second request. Consider the online problem of trying to find a treasure in a maze, where you are not given a map of the maze beforehand. Your view of the maze for the second step depends on what choice you made during the first step, although it is the same maze. An online problem is heteroscopic if the input data you receive may depend on a previous decision, even if the request is unchanged. For example, suppose your cache consists of pages a and b, and the next two requests are c and a, and your algorithm is trackless. If you eject b after the first request, then for the next request, you are told that the requested page is a. But if you eject a instead, then for the second request, you are simply told that it is a page you don't have in your cache, and you don't know whether it is the one you just ejected.