pkgsrc/games/crafty/PLIST

@comment $NetBSD: PLIST,v 1.2 2002/01/12 05:48:15 jlam Exp $
bin/crafty
lib/crafty/books.bin
share/doc/crafty/read.me
share/doc/crafty/crafty.faq
@unexec ${RMDIR} -p %D/share/doc/crafty 2>/dev/null || ${TRUE}
@dirrm lib/crafty
Update games/crafty to 18.13. Changes from version 18.12 include: * Deep Blue extension limit removed and restored to one ply of extension per ply of search. * pruning in q-search fixed so that a capture will be considered if it takes the total material on the board down to a bishop or less for the opponent, as that can greatly influence the evaluation with the EvaluateWinner() code. * as the 50 move rule draws near, the hash table scores are marked as invalid every 5 moves so that hashing can't hide potential 50-move-rule draws. * lazy evaluation code modified to be more conservative, since in endgames the positional score can be a large change. * EvaluatePassedPawnRaces() fixed so that if one side has two pawns that are far enough apart, it will recognize that even though the king is "in the square" of either, it can't always stay in the square of one if it has to capture the other. * pawn hash signature restored to 64 bits after testing proved that 32 was producing an unacceptable number of collisions. * search node counter is now 64 bits as well to avoid overflows. * in the outside passed pawn code fixed (bad mask). 2002-01-12 06:48:15 +01:00			`@comment $NetBSD: PLIST,v 1.2 2002/01/12 05:48:15 jlam Exp $`
crafty: chess engine -- plays a MUCH better game of chess than GNU Chess. 2000-10-15 04:06:27 +02:00			`bin/crafty`
			`lib/crafty/books.bin`
			`share/doc/crafty/read.me`
			`share/doc/crafty/crafty.faq`
Update games/crafty to 18.13. Changes from version 18.12 include: * Deep Blue extension limit removed and restored to one ply of extension per ply of search. * pruning in q-search fixed so that a capture will be considered if it takes the total material on the board down to a bishop or less for the opponent, as that can greatly influence the evaluation with the EvaluateWinner() code. * as the 50 move rule draws near, the hash table scores are marked as invalid every 5 moves so that hashing can't hide potential 50-move-rule draws. * lazy evaluation code modified to be more conservative, since in endgames the positional score can be a large change. * EvaluatePassedPawnRaces() fixed so that if one side has two pawns that are far enough apart, it will recognize that even though the king is "in the square" of either, it can't always stay in the square of one if it has to capture the other. * pawn hash signature restored to 64 bits after testing proved that 32 was producing an unacceptable number of collisions. * search node counter is now 64 bits as well to avoid overflows. * in the outside passed pawn code fixed (bad mask). 2002-01-12 06:48:15 +01:00			`@unexec ${RMDIR} -p %D/share/doc/crafty 2>/dev/null \|\| ${TRUE}`
crafty: chess engine -- plays a MUCH better game of chess than GNU Chess. 2000-10-15 04:06:27 +02:00			`@dirrm lib/crafty`