Editing Newcomb's paradox (section)

==The problem==
There is a reliable predictor, a player, and two boxes designated A and B. The player is given a choice between taking only box B or taking both boxes A and B. The player knows the following:<ref name="Wolpert">{{cite journal |first1=D. H. |last1=Wolpert |first2=G. |last2=Benford |title=The lesson of Newcomb's paradox |journal=[[Synthese]] |date=June 2013 |volume=190 |issue=9 |pages=1637–1646 |doi=10.1007/s11229-011-9899-3 |jstor=41931515|s2cid=113227 }}</ref>
* Box A is transparent and always contains a visible $1,000.
* Box B is opaque, and its content has already been set by the predictor:
** If the predictor has predicted that the player will take both boxes A and B, then box B contains nothing.
** If the predictor has predicted that the player will take only box B, then box B contains $1,000,000.
The player does not know what the predictor predicted or what box B contains while making the choice.