HermanHiddema/Problem Encoding

Sub-page of HermanHiddema

Is there an easy way to "encode" problems, so that the become a unique string?

An attempt:

Two characters, indicating size of the problem 0-9A-Z (1-36 in both directions, smallest first)

One character indicating type:

  1. Corner problem
  2. Edge problem (largest dimension along edge)
  3. Edge problem (smallest dimension along edge)
  4. Whole side problem (largest dimension along edge)
  5. Whole side problem (smallest dimension along edge)
  6. Whole board problem

Remaining characters encode board.

 - = EEE
 A = EEB
 B = EEW
 C = EBE
 D = EBB
 E = EBW
 F = EWE
 G = EWB
 H = EWW
 I = BEE
 J = BEB
 K = BEW
 L = BBE
 M = BBB
 N = BBW
 O = BWE
 P = BWB
 Q = BWW
 R = WEE
 S = WEB
 T = WEW
 U = WBE
 V = WBB
 W = WBE
 X = WWE
 Y = WWB
 Z = WWW

Example:

[Diagram]

Encoding does not encode empty space around it, so actually encodes:

[Diagram]

Which is:

 E W B E E B
 E E E W W B
 W W W B B B
 B B B B E E


Encoded:

 G A
 - Y
 Z M
 M I

So, adding sizes (4x6) and type (corner), we get:

 461GA-YZMMI

How long is this likely to get?

The first three characters are alwas there, and after that, there's one character per 3 points on the board. So for a 9x9 corner problem (81 intersections) it is 30 characters long

For 19x19 = 361 intersection it is 124 characters long Max is 36*36 = 1296 / 3 + 3= 435 characters for 36x36 problems :)


This is a copy of the living page "HermanHiddema/Problem Encoding" at Sensei's Library.
(OC) 2016 the Authors, published under the OpenContent License V1.0.
[Welcome to Sensei's Library!]
StartingPoints
ReferenceSection
About