Author: Les Fernandez
Date: 18:27:17 10/28/99
Go up one level in this thread
On October 28, 1999 at 18:47:39, KarinsDad wrote: >On October 27, 1999 at 18:56:33, Les Fernandez wrote: > >[snip] >>> >>>Next problem. How do you differentiate between a knight 010 and a queen 0101? >>>How do you know whether the pattern 0101 is a white knight followed by a black >>>piece or a white queen? >> >>As far as this question KD what I am proposing is that the binaries on each >>individual line represent an individual square on the chess board. What I think >>confused you was the fact I think you thought that these binaries were in a >>horizontal contiguous string. What I am proposing is to allocate an individual >>line for each of the bit board. That way there is no need to distinguish >>between whether the pattern 0101 is a white knight followed by a black piece >>etc. What it is meant to say is the following: Bit 1=0=black Bit 2,3 and 4 >>represent a 5 and is equal to a Queen. So binary 0101 is a black queen. I >>think this also answers your next question which is similar. I hope this >>clarifies it for you KD and if not drop me a line. >> > >What is the definition of "an individual line"? > >How does one know when one has reached the end of a line? > >Is this the standard ASCII new line character in a text file that takes up 8 >bits of data (8 bits in a byte)? If so, you need to add 63 bytes to your 29 byte >(152 bit) solution. > >I hope you now understand why we are confused. > >You need a new line delimiter in order for your algorithm to work. Additionally, >this delimiter must be unique to your other bit streams, so therefore, it must >be at LEAST 3 bits long (you would not need to use the 8 bits of a new line >character, you could use a smaller delimiter). > >The problem is that computers HAVE to read in either a serial stream of bit >level or byte level (or whatever sized) data which they can parse, or they have >to have the data compartmentalized with some form of structure (for example, a >database record) around it to indicate different "pockets" (in your case >squares) of information. That's how it works. > >In a text file, there are unique bytes of data surrounded by newline bytes. It >just so happens that word processors parse that data and every time they get to >a newline character, they start the text after the newline character on the next >line. That newline character still takes up 8 bits of data. However, it is not >textual data, but rather state (where to place the next text) data. > >The problem with your algorithm is that you have not told the program that reads >the data how to distinguish between lines. Once you do that, you will add many >bits. > >KarinsDad :) Hi KarinsDad, Yes I see what you are referring to. Well maybe time to get back to the drawing board <s>. Thank you for your clear explanation. I overlooked the fact that to see a new line something needs to be there to indicate that and thus will take up more space. Les :(
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.