Deterministic Algorithms are the easiest AI techniques from the programmer's standpoint. These algorithms use the set of data that represents the variables of the game, and use the information to carry out a preprogrammed task or behavior. This behavior goes unchanged throughout the course of the game and is completely relentless, and thus predictable, to the human opponent. Examples of computer games using deterministic algorithms are the ghosts that mindlessly chase you in Pac-Man. The problem inherent with deterministic algorithms is that the computer performs them with no consideration for the outcome, past, or future events.