New answers tagged board-games
2
votes
Find Minimum Transformation Between Multisets of Lists of Cards
Update (or possible correction) to the answer of D.W..
Since we are given the move operations and not the swap operations, we can compute $\pi$ in polynomial time. The problem is known as the ...
- 5,817
3
votes
Find Minimum Transformation Between Multisets of Lists of Cards
I think the variant with sets can be solved using bipartite matching.
Build a complete bipartite graph, with one left vertex per set in s0 and one right vertex per set in s1. Also, if there are fewer ...
D.W.♦
- 156k
Top 50 recent answers are included