A classic puzzle asks for the placement of as many disjoint dominoes (1×2 tiles) as possible onto a checkerboard from which some squares have been removed. The problem can be solved by setting up a bipartite graph where one part consists of the white unblocked squares, the other consists of the black unblocked squares, and edges correspond to adjacency of squares. Then a maximum matching (a collection of disjoint edges that is as large as possible) in this graph leads to a solution of the domino problem. In this Demonstration, the blocked squares are red, the graph is shown in blue, and the maximum domino array is shown in yellow. To add or remove blocked squares, ... -click or ... -click a square.


    Education Levels:


      EUN,LOM,LRE4,work-cmr-id:398753,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/PlacingDominoesOnACheckerboard/,ilox,learning resource exchange,LRE metadata application profile,LRE


      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0


      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467