[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums

Trad to nactation conversion algorithm

Posted By: Matt Ryder
Date: Monday, 7 February 2011, at 3:21 p.m.

In Response To: Computer-friendly Nactation methodology for variant/family symbols (Nack Ballard)

So am I right in assuming that a trad to nactation conversion algorithm should ideally store all possible (non-assumptive) nactation symbols for each play? That way you could do some pretty interesting analyses of the different patterns that emerge.

The algorithm should not store the symbol unless it is unambiguous. In your original tutorial, you warn that 43Z-62H is ambiguous and should be designated 43Z-62R instead. So for 54D-62, both R and H should be stored, but for 43Z-62 only R should be stored.

What this implies is:

Every possible nactation symbol should be evaluated for compliance with a given trad move (converted to a position), against a series of defined rules.

To make this process more efficient, I can work out some techniques for truncating the search according to a set of principles - for example, I don't think a position can be both E and e at the same time so no need to check further down the family after E is determined. Equally a move that is focused exclusively on the near/inner board quadrants cannot simultaneously be B, C, E, G, Y, M, S, Z, U, V, W or R (or others I missed?).

Then for each compliant symbol, I'll check to see if it's unambiguously compliant. If so, I'll store it.

Writing this sounds like a fun challenge. As soon as your updated tutorial is released, I'll take a crack at it.

Matt R.

Messages In This Thread

 

Post Response
Your Name:
Your E-Mail Address:
Subject:
Message:

If necessary, enter your password below:

Password:
 

 

[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums is maintained by Stick with WebBBS 5.12.