[quote="Stefan Pohl"]
Texel 1.02 ist da und kann auf Jim Abletts Seite heruntergeladen werden. Der Changelog ist ziemlich üppig für so eine kleine Versionsnummer-Änderung...

Stefan

http://jimablett.net63.net/
[/quote]

Hier der Changelog des Autors:

2013-06-08: Texel 1.02
- Fixed KNNpK evaluation bug.
- Fixed infinite loop when engine received EOF on standard input.
- Only do one check in q-search.
- Speeded up and improved the search tree log file analyzer.
- Remember history information between searches.
- Remember best move (for LMR threat detection) also when there is a
  transposition table hit or when going into q-search on the next ply.
- Cache line aligned the main transposition table and the pawn hash table.
- Use cache-optimized magic bitboard constants.
- Handle stalemate in kqkp endings with pawn on a2/h2 and king on a1/h1.
- Detect illegal moves before playing them. Makes code look nicer.
- Reduce aspiration window from 20cp to 15cp.
- Gradually widen aspiration window after fail high/low at root.
- Store stale-mate scores in transposition table.
- Don't do LMP if best move so far is negative mate score.
- Smaller razor margin at depth <= 1.
- Support for SSE4.2 and POPCOUNT.
- Added knight mobility evaluation.
- Added KRPKR end game evaluation based on table base statistics.
- Use different bishop piece square table in the end game.
- Some speed optimizations.
- Fixed castle bonus asymmetry.
- Use an incrementally updated material identifier to simplify end game
  classification.
- When ordering root moves, use accumulated node counts instead of just last ply
  counts.
- Added evaluation term for bad bishops.
- Rescale history counters before starting a search, so that they adapt faster
  to the new situation, but still remember information from the previous search.
- Use a material hash table with material score and interpolation factors for
  other evaluation terms.
- Added evaluation term for redundancy of major pieces.
- Made history aging symmetric with respect to success/failure.
- Implemented knight outpost evaluation.
- Optimized pawn structure, major piece redundancy and knight outpost weights
  using CLOP.
- Disabled late move pruning in late end games.
- Fixed crash if EOF is received on standard input while engine is thinking.
- Better time management in "ponder on" games with increment.
- When only one legal move is available, think slightly longer than 2 ply.

Es gibt aber riesen unterschiede zwischen den JA-Compiles und dem original in den dateigrößen
JA ~350KB  original ~2700KB
Wie ist denn sowas erklärbar ?!
Welche sind denn jetzt "besser"

http://web.comhem.se/petero2home/javachess/index.html#texel