|
|
|
Here is the given 6 card. If place all related values in 6x6 boxes like: row1 (0,4,5,2,1,3) row2 (-,0,1,2,3,1), row3 (-,-,0,3,4,2) row4 (-,-,-,0,1,1) row5 (-,-,-,-,0,2) row6 (-,-,-,-,-,0). How to choose step 1? It is not so obvious for this given one. But if doing the same for 123456 the pattern is quit clear. Then compare the easy one with 123654 the pattern still the same (although some steps can be switched the minimum value keeps the same). By quickly checking some 4 cards settings, found no exceptions. The rule is, eg for step 1, add up all corresponding same row/col values and then minus the chosen diagonal box value, the highest one should be chosen to move in that step. If there are more than one highest values any corresponding move can not chosen which does not change the final result (meaning there exists different move sequences to lead to the same minimum value). The SQL for the process is simple with reclusively determining sum values in each step until the last diagonal box is processed. But keep in mind after each step the corresponding box (row/col) values need to be excluded. If anyone is interested please try it out. It should perform fast to see up to which N number this rule holds. Until then one can only think what is it’s deeper meaning in math and how it may be related to the shown math part in specific given eamples. |
|
楼主: 〇〇
IP卡
狗仔卡
发表于 2021-6-9 21:57
显身卡