Author: Dann Corbit
Date: 14:55:00 01/03/06
Go up one level in this thread
On January 03, 2006 at 17:18:13, Alessandro Scotti wrote: >On January 03, 2006 at 10:41:53, Ratko V Tomic wrote: > >>It may appear as an off topic post, but folks here encoding tablebases may wish >>to check it out (see the source code on the QI web page). For that type of data >>the QI is much better than Huffman or Arithmetic coding. > >Hi Ratzo, >congratulations for an exceptional and very important result! I think there may >soon be news in some data compression programs so I have a question: is this >algorithm patent free? I must ask because if I remember correctly Arithmetic >Coding (among others) is protected by a patent and many free programs had to use >Huffman or some other sub-par algorithm. There is a license.txt file that seems to indicate that the algorithm may be used for non-commercial purposes.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.