tag:blogger.com,1999:blog-890098023535122095.post1435845889412808653..comments2017-06-28T19:02:01.728-07:00Comments on A Journey Through Information Science!: Communicating using Chessboards!Vaishakh Ravihttp://www.blogger.com/profile/18150579827312535135noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-890098023535122095.post-61669402173243037022017-06-28T19:02:01.728-07:002017-06-28T19:02:01.728-07:00Nice! Just so as to make your solution a bit more ...Nice! Just so as to make your solution a bit more clear to the reader, here's what we do: For each of the 64 positions on the board, we assign a 6-bit number. A heads on a particular square is denoted by a '1' and a tails by a '0'. <br /><br />To encode, Alice first computes the XOR sum or parity of the 6-bit positions where there is a '1'. Denote the resulting sum by X. Say the intended 6-bit message to send is M. Then, Alice simply flips the coin on the square corresponding to the XOR sum: M+X. <br /><br />To decode, upon seeing the board, Bob now computes the same XOR sum of the 6-bit positions where there is a '1'. This sum is now M (by virtue of our flipping M+X).Vaishakh Ravihttps://www.blogger.com/profile/18150579827312535135noreply@blogger.comtag:blogger.com,1999:blog-890098023535122095.post-59114260806225372002017-06-28T17:02:11.211-07:002017-06-28T17:02:11.211-07:00Bob after receiving the message will extract bit &...Bob after receiving the message will extract bit 'i' by calculating the parity of all the 32 locations on the board whose bit-representation has 1 in the position 'i'. Alice will simply see the initial configuration of the board, calculate the subset of bits which need flipping, and then change the exact location which has 1s only on that subset in its bit-representation (in case no flipping is required Alice will change the location '000000').<br /><br />- "The puzzle guy"Anant Dhayalhttps://www.blogger.com/profile/08098344659895725485noreply@blogger.com