1==0.43.1==
2Small fixes: appdata and desktop file, moved to an unordered_set header that
3should work on most compilers. Should still port to autotools or something
4similar sometimes in the future.
5
6==0.43==
7Complete code rewrite. As I go on trying to grok C++, algorithms and data
8structures, and as I started to understand more of Peter's code, I found
9it useful to rewrite all this stuff from scratch.
10This should solve some issues and probably introduce new ones. Therefore this
11version needs a lot of playtesting and bug-hunting.
12The algorithm has been split into two, one with the next block preview (normal)
13and one without (harder).
14New and more sophisticated techniques are now used to write the  block-choosing
15algorithms, which should not be fooled as easily as before.
16
17==0.41==
18Features a brand-new AI, which should provide a much less boring gameplay
19and avoid some bugs of the previous one. I have not done any work on the
20interface since my primary goal is having a good algorithm, and not the
21eye-candy. This new version somehow avoids the endless queues of the same
22block you saw in 0.37: unfortunately, this makes the game a bit easier
23(now you can do five lines with much less effort). If you do not like
24the thing, you can tweak the figures at the bottom of bast.c, which should
25look like this:
26      const int bl_percent[BLOCK_TYPES]={75,92,98,100,100,100,100};
27that is: 75% chance you will get the worst brick, 92-75% for the second one
28and so on (no chance to get the best three bricks).
29Editing to 85,95,100,100,100,100,100 will considerably increase the difficulty
30of the game (TODO: some better way to choose this...).
31Moreover, the old 0.37 algorithm can be compiled in (instead of the new one)
32by simply renaming bast-old.c to bast.c
33==0.37==
34First public release, created by modifying Petris by Peter Seidler.
35
36