PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 66: Advanced Combinatorial and Search Algorithms
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
  2. 66.02Branch and bound
  3. 66.03Exact cover
    1. Algorithm X
    2. Dancing Links (DLX)
    3. Constraint incidence matrix
  4. 66.04Binary decision diagrams
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
  2. 66.02Branch and bound
  3. 66.03Exact cover
    1. Algorithm X
    2. Dancing Links (DLX)
    3. Constraint incidence matrix
  4. 66.04Binary decision diagrams
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
Home/DSA/Advanced Combinatorial and Search Algorithms/Exact cover
66.03Advanced / Expert3 topics

Exact cover

Part of Chapter 66: Advanced Combinatorial and Search Algorithms.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

66.03.1

Algorithm X

Explanation coming soon.

66.03.2

Dancing Links (DLX)

Explanation coming soon.

66.03.3

Constraint incidence matrix

Explanation coming soon.

← Previous · 66.02

Branch and bound

Next · 66.04 →

Binary decision diagrams

On this page

  • Algorithm X
  • Dancing Links (DLX)
  • Constraint incidence matrix