Computer Programmers solve checkers.

[Hexadecimal]

The reason it sucked is precisely because it did the +EV play (in terms of its hand's pure value) every time. This is an exploitable strategy. If the computer never bluffs, it's not going to get maximum value for its big hands against a decent player. Instead, it should take into account how often its opponent will fold to a bet/bluff and how much is in the pot, and then throw in an appropriately-sized bluff bet randomly a certain percentage of the time to mix things up. According to game theory, there's an optimum bluffing frequency (and bet size) for each opponent, which makes it impossible for your opponent to beat you in the long run. (See Sklansky's Theory of Poker for why this works.)