请输入您要查询的百科知识：

　

词条 Blockbusting (game)
释义

  1. References

{{technical|date=November 2018}}{{Other uses|Blockbusting (disambiguation)}}{{short description| A combinatorial game solved using overheating }}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 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

1. ^{{cite journal|last= Berlekamp|first= Elwyn|author-link=Elwyn Berlekamp |date= January 13, 1987|publication-date= September 1988|title= Blockbusting and Domineering|url= https://ac.els-cdn.com/0097316588900283/1-s2.0-0097316588900283-main.pdf?_tid=d0939db9-46c7-4e58-ad05-8a659ea988e2&acdnat=1538430082_200c08afb1fa31f85820ba8725daec82|journal= Journal of Combinatorial Theory |volume= 49|issue= 1|pages= 67–116|doi= |access-date= October 1, 2018}}
2. ^{{cite book | first=Elwyn R. | last=Berlekamp | authorlink=Elwyn Berlekamp | first2=John H. | last2=Conway | author2-link=John Horton Conway | first3=Richard K. | last3=Guy | author3-link=Richard K. Guy | title=Winning Ways for Your Mathematical Plays | publisher=A K Peters | edition=2nd | date=January 1, 2001 | isbn=1-56881-130-6 | pages=187 }}
3. ^{{cite book | last = Siegel | first = Aaron N. | isbn = 978-0-8218-5190-6 | mr = 3097920 | page = 490 | publisher = American Mathematical Society, Providence, RI | series = Graduate Studies in Mathematics | title = Combinatorial game theory | url = https://books.google.com/books?id=VUVrAAAAQBAJ&pg=PA490 | volume = 146 | year = 2013}}
4. ^{{cite book |last1= Berlekamp|first1= Elwyn |author-link= Elwyn Berlekamp| last2= Wolfe |first2= David |author2-link= David Wolfe (mathematician)|date= 1994|title= Mathematical Go Endgames |publisher= Ishi Press |page= 52| isbn= 0-923891-36-6}}
{{game-stub}}

3 : Abstract strategy games|Combinatorial game theory|Solved games
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/11/13 12:59:28