Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-17T18:21:57.103Z Has data issue: false hasContentIssue false
  • English
  • Français

FUNCTIONAL PEARL On tiling a chessboard

Published online by Cambridge University Press:  27 October 2004

RICHARD S. BIRD
RICHARD S. BIRD
Affiliation:
Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford OX1 3QD, UK (email: richard.bird@comlab.ox.ac.uk)
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Teacher: Good morning class. Today I would like you to construct a program for finding out how many ways a chessboard can be tiled with dominoes. For those who don't play games, a chessboard is a 8×8 board divided into 64 squares, and a domino is a 2×1 tile which can cover two squares of the board either vertically or horizontally. For example, a 2×2 board can be covered with two dominoes in exactly two ways, with both dominoes horizontal or both vertical.

Type
Functional pearls
Information
Journal of Functional Programming , Volume 14 , Issue 6 , November 2004 , pp. 613 - 622
Copyright
© 2004 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.