What's the Optimum Strategy for these Flash Games

I’m talking about the games where you essentially have a gird of blocks of various colors. The object is to either select a block, which removes all adjacent blocks of the same color, or to swap a block with an adjacent block to complete three (or more) in a row, removing them from the board. It seems like there must be some algorithm here for top performance.

Here are some links to various games that fall into this category.

http://www.addictinggames.com/blocks.html
http://www.addictinggames.com/bejeweled2.html
http://www.addictinggames.com/crashdown.html
http://www.2flashgames.com/f/f-454.htm

No answer, but I think a game that combined those two functions might be quite fun

For the select-a-block ones, if I’m thinking of the same sort of thing you are, the score for each cluster of blocks scales nonlinearly with the number of blocks in the cluster. For instance, a bit of just two blocks might be a single point, but 10 blocks all together might be worth 81 points, and . In this case, what you want to do is pick one color, and click around that color in such a way as to get as huge a cluster as possible, then when you can’t get it any bigger, get the big points from it.