@amon Of course I've discussed it with them, I'm not an idiot. They've requested presentation of alternative technical solutions and do not look fondly upon homebrewn alternatives since there is no reference as of how it will be judged in court (if at all). Hence asking for widely spread, "to big to fail" technical solutions, to present to the legal counsel. And yeah, I don't trust randos at all, but at least they can provide some perspective not attainable from friends and collegues.

Agreed. Voting answered for point 3 as xprt ctrl and classification cannot be centralized for the project. I also need some guard against losing the license along the way because of "accidents" - user error or ignorance. Git hooks should work if the hooks are implemented by a private proxy Git server, and the metadata carried by the lifecycle tool accessible by the server... Maybe I'm lazy, are there examples of wide-spread software using mentioned strategies? Hopefully at least one of above mentioned strategies are "to big to fail" - if MS/Google/IBM/etc does it, so can I.

@amon To a degree, yes, because interpretation is internal company policy. However the company is doing this because of international (primarily US) laws, and fear of being sued, sanctioned or even inprisoned. That fear is common for all companies.

looks good. way to complex to implement within a days work (if I do it myself), and I couldn't find any trustworthy implementation this side of the millenia, so it looks like I'll have to make an effort at some point. like you say, given the graph is regular I can probably use heuristics to narrow the search

@Jules I edited the question to clarified that the optimizer will only need a few of the best paths from a to b. Path length is generally not very long either (edit pending) which should allow for solution to stay within reasonable resource limits. The network is not random at all, it is a grid where each cell is a node having axis aligned arcs to other nodes, unless there are obstacles.

If a developer uses C() without looking at the documentation the developer does not deserve success.

@gnasher729 Please don´t insult RGB565. With just a little dithering it looks great ;-)

@vartec The article and quote says "The commonly used sizes are usually a power of two multiple of the unit of address resolution (byte or word)" and "most modern computer designs have word sizes (and other operand sizes) that are a power of two times the size of a byte." I read "word size" is measured in bytes, not bits. There is no rule about word size in bits is or should be powers-of-2 in the article.

What is a "bitmap of packed words"? Does HighColor suit that description?