flat assembler
Message board for the users of flat assembler.
![]() Goto page Previous 1, 2 |
Author |
|
bitRAKE 09 May 2020, 22:31
This is often the way things progress. For example, the general MxN algorithm producing minimal clues: I feel I could construct a program to build these puzzles, but don't know enough mathematics to prove the general case - intuitively it seems as if it must be true. I've searched for a paper of similar and nothing. Maybe it is out there in Chinese or Russian. The tools used in such a proof would be useful elsewhere.
It is like in programming when we talk about algorithms - they are base examples of a technique and can be pieced together like Legos, or used in spirit as our comfort with them increases. There are some great write-ups in programming describing high-level algorithms where the genius and novelty is quite inspiring. |
|||
![]() |
|
Goto page Previous 1, 2 < Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2025, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.