gusl: (Default)
[personal profile] gusl
Don't you hate it when you *knew* the answer to a question, but you didn't remember to put it on your paper, and leaving the impression that you didn't know?

This concerns the question of a more efficient algorithm for Constrained n-Rooks: of course I know of one. I was talking about it last summer! The idea is to *first* prune (making those entries 0) and make all the remaining entries 1, and *then* use a k-th best assignments algorithm, for increasing k. The admissible permutations will score equally well (with a score of n).

I just wasn't concerned about algorithms for many many months.

February 2020

S M T W T F S
      1
2345678
9101112131415
16171819202122
23242526272829

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags