Software:Blockbusting (game)
Blockbusting is a solved combinatorial game introduced in 1987 by Elwyn Berlekamp illustrating a generalisation of overheating.[1][2]
The analysis of Blockbusting may be used as the basis of a strategy for the combinatorial game of Domineering.[3]
Blockbusting is a partisan game for two players known as Red and Blue (or Right and Left) played on an [math]\displaystyle{ n \times 1 }[/math] strip of squares called "parcels". Each player, in turn, claims and colors one previously unclaimed parcel until all parcels have been claimed. At the end, Left's score is the number of pairs of neighboring parcels both of which he has claimed. Left therefore tries to maximize that number while Right tries to minimize it. Adjacent Right-Right pairs do not affect the score.
Although the purpose of the game is to further the study of combinatorial game theory, Berlekamp provides an interpretation alluding to the practice of blockbusting by real estate agents: the players may be seen as rival agents buying up all the parcels on a street, where Left is a segregationist trying to place his clients as neighbors of one another while Right is an integrationist trying to break them up.
The operation of overheating introduced to analyze Blockbusting was later adapted by Berlekamp and David Wolfe to warming to analyze the end-game of Go.[4]
References
- ↑ Berlekamp, Elwyn R (1988-09-01). "Blockbusting and domineering" (in en). Journal of Combinatorial Theory, Series A 49 (1): 67–116. doi:10.1016/0097-3165(88)90028-3. ISSN 0097-3165.
- ↑ Winning Ways for Your Mathematical Plays (2nd ed.). A K Peters. January 1, 2001. pp. 187. ISBN 1-56881-130-6.
- ↑ Siegel, Aaron N. (2013). Combinatorial game theory. Graduate Studies in Mathematics. 146. American Mathematical Society, Providence, RI. p. 490. ISBN 978-0-8218-5190-6. https://books.google.com/books?id=VUVrAAAAQBAJ&pg=PA490.
- ↑ Berlekamp, Elwyn (1994). Mathematical Go Endgames. Ishi Press. p. 52. ISBN 0-923891-36-6.
 |
