grafx - Extensible Java Graphics Package Code

Better println() statements and reduced "q" factor which gives almost same
results.

Making the impossible level much harder. The computer player can still pass
this most of the time.

My program is able to easily pass this level now.

Implemented the "search for q best moves" with next block as input. Had to
jump through some hoops for the time being.

Implementing getBestPossibleMove() and getQBestMoves(). This is very exciting.
I am very excited.

Simplifying evalWithNextBlock(), making use of the new function
getNBestMoves() in BlockPlacementStrategy.

Improving comments a little bit, removing dead line of code.

Implementing getNBestMoves() in BlockPlacementStrategy. Completely untested.

Reverting back to the old linear combination of metrics. There is some magic,
some secret sauce which makes this combination work extremely well. I simply
cannot explain it, other than stating the observation that this combination
seems to consistently pass the hardest impossible level, and every single time
at that.

Trying some new metrics. These are not working very well.