chessgames.com
Members · Prefs · Laboratory · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing
 
Chessgames.com User Profile Chessforum

Sneaky
Member since Jan-19-02
I live in South Florida USA. Rated USCF ~1800

A long time ago I was a new player in a Miami chess park, and one of the stronger players thought I had real talent, so he suggested that I play the park champ, a Cuban master. After the master destroyed me in a few blitz games, the question was posed, "Is he any good?" The answer I took as a great compliment: "Ehh... he tries to be sneaky."

The greatest chess player of all time is Robert James Fischer. The greatest chess problemist of all time is Sam Loyd. The greatest chess site of all time is chessgames.com!

Other players who I admire:

<Morphy> Possibly the greatest natural chess talent ever. Like Steinitz who followed, he taught the world how the game should really be played. <Najdorf> He was smart enough to make his money outside of chess, so he played for the pure joy of it. <Tal> Proved that even in the modern era, chess is an art more than a science. <Blackburne> Sacrificed his queen more times than I've had hot meals. <Diemer> One of the most original thinkers the game ever has known. His ideas were not always right, but they were HIS ideas. <Topalov> He hates draws so much he'll gladly risk losing to avoid one. I can forgive him for the Elista debacle; his chess is payment enough. <Lembit Oll> When on the attack, Lembit Oll said "Dambit All!" <Kasparov> Strive for perfection, one move at a time. <Alekhine> Swashbuckling play culminating in booming sacrifices.

And countless others: Nezhmetdinov, Shirov, Nunn, Shabalov, Nakamura, basically, anybody with cojones.

Addendum 2015: <Magnus Carlsen> has to be on the list. He's a modern day Casablanca. The way he squeezes wins out of the tiniest advantages and grinds his opponents down through sheer stamina is right up there with Robert James.

You can find me on FICS (freechess.org) ... and lately, on ICC as well. I'll gladly play anybody within 1000 points of my rating. I also really like the site http://www.lichess.org but so far have only played anonymously.

>> Click here to see Sneaky's game collections.

Chessgames.com Full Member

   Sneaky has kibitzed 13504 times to chessgames   [more...]
   Jul-21-18 Kramnik vs Giri, 2018 (replies)
 
Sneaky: I like the new Giri photo. Sharp dressed young grandmaster.
 
   Jul-21-18 Duda vs Nepomniachtchi, 2018 (replies)
 
Sneaky: For those who care what engines think... 52.b4! retains the initiative according to Stockfish. If true, that’s a hard move to see. And I’m not sure if it isn’t just having horizon blindness. It’s in love with the idea of getting Qa2+ in.
 
   Jul-20-18 Biographer Bistro (replies)
 
Sneaky: <if I said "I live 90 minutes from Miami" I am not being ambiguous.> That's entirely ambiguous! 90 minutes by airplane? By automobile? By foot?
 
   Jul-20-18 Chessgames Bookie chessforum (replies)
 
Sneaky: The first music I ever owned in my life were two eight track tapes my mother gave me. One was the Eagle’s Greatest Hits; the other was Pink Floyd’s Animals.
 
   Jul-20-18 Nepomniachtchi vs Kramnik, 2018 (replies)
 
Sneaky: <Marmot PFL: <c5/d5 are “hanging pawns” right?> Not really, black doesn't have an open c-file.> You are colorectal. (I’m sorry, I meant “correct.” Stupid auto-colorectal.)
 
   Jul-18-18 Kramnik vs Duda, 2018 (replies)
 
Sneaky: Who is it who mockingly said “All rook endings are drawn?”
 
   Jul-10-18 Dortmund Sparkassen (2018) (replies)
 
Sneaky: Coors is like making love in a canoe. It’s ****ing close to water.
 
   Jul-03-18 S Vaibhav vs Carlsen, 2018 (replies)
 
Sneaky: <vabe vs vibe> ssssshhhh... don't spoil morf's fun. He lives for this stuff. So what's White's error here? I've never seen the Scandi get so much counterplay so quick. Is 4.f3 the culprit?
 
   Jun-28-18 Rameshbabu Praggnanandhaa (replies)
 
Sneaky: Returning to India with a very warm reception :D https://twitter.com/maxinmathewTOI/...
 
   Jun-17-18 E Terpugov vs Petrosian, 1957 (replies)
 
Sneaky: The pun is a reference to the movie "300", specifically https://www.youtube.com/watch?v=eZe... .
 
(replies) indicates a reply to the comment.

Sneaky's Shanty

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 44 OF 58 ·  Later Kibitzing>
Jul-18-08  YouRang: <rinus: <YouRang> Ever heard of Monte Carlo methods?>

Yes, I had an algorithms class in college, although my recollection of it is pretty foggy (to say the least) now.

I gather that this is related to coming up with some sort of computer simulation of this problem? I think it might be very tricky to avoid inadvertantly programming some distortion into it.

But what do you have in mind? :-)

Jul-18-08  sentriclecub: Also, for what its worth, the one switch variation is the most convincing paradox I've ever found. So if there are still unrevolved questions after reading the wikipedia and poker article, I think that means you have devoted some of the necessary hours to fully appreciate it. I for one would still "switch" if I opened $5, regardless of the "factor of increase/decrease" but we all agree that if you opened $100 million, its a sure-keep.

Again, no longer trying to add confusion. I still believe this "switch or keep" problem is unsolvable because of the flawed, yet intuitively reasonable premise.

Thanks to all who chimed in with their 2 cents.

Jul-19-08  amadeus: <Sneaky>, I'm still thinking about the puzzle. It's really a tricky one, and I've tried to follow your line of reasoning.

I think the following example might give you (us) some light (sorry my poor English).

Let's say we put X dollars in the Envelop A. Then we flip a coin, in order to determine if the envelope B will have 2X or X/2 dollars.

Now our outcome is:

KEEP THE ENVELOPE
50% X
25% 2X
25% X/2
EV: 1.125X

SWITCH THE ENVELOPES
25% X => 2X
25% X => X/2
25% 2X => X
25% X/2 => X
EV: 1.125X

Keeping or switching, we have the same EV (1.125X), and you have no idea of what to do (because you don't know if your envelope contains X, 2X or X/2, whatever the value of X).

That, I believe, was your mistake: assuming that you have X, and the other one is 50%2X or 50%X/2. But that's not the case.

Actually, your envelope, whatever its value, represents 1.125X -- that is (50%X + 25%X/2 + 25% 2X). Just like the other one.

QED? Does that make any sense?

Only God knows. But I think for now that's all folks :)

PS: of course, I could have just stated that in the standard version of the puzzle (Y and 2Y), your envelope represents 1.5 Y (that is, the EV), but I think the example above is a bit more illustrative.

Jul-19-08  ganstaman: <amadeus: QED? Does that make any sense? >

Moreso than anything else I've read. It seems to take care of the issue wikipedia mentioned that Sneaky asked about:

<Sneaky:
<1. Denote by A the amount in the selected envelope

7. So the expected value of the money in the other envelope is

(1/2)*(2A) + (1/2)*(A/2) = (5/4)*A

The most common way to explain the paradox is to observe that A isn't a constant in the expected value calculation, step 7 above. In the first term A is the smaller amount while in the second term A is the larger amount. To mix different instances of a variable or parameter in the same formula like this shouldn't be legitimate, so step 7 is thus the proposed cause of the paradox.>

The part that confuses me is the claim "to mix different instances of a variable or parameter in the same formula like this shouldn't be legitimate".>

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang>

<You're now heading into the murky land of approximations, and I'm not sure I want to follow. But I'll give one example: if we see that one envelope has 0.03 in it, then the other envelope might have either 0.01, 0.02, 0.05, 0.06 or 0.07 (each with varying degrees of probability). Do you really want to deal with such possibilities?>

If you let 2X > 0 (no upper boundary on 2X cq X) , then your problem will statistically totally float away.

The problem is a supposed/felt 'upper boundary' on 2X cq X ; look at <sentriclecub>'s posting:

<I for one would still "switch" if I opened $5, regardless of the "factor of increase/decrease" but we all agree that if you opened $100 million, its a sure-keep.>

Monte Carlo Methods:

Suppose you want to calculate the integral of a function via MCM; example:

function ... X^3

INTEGRAL[0..1](X^3)dX = 0.25 as we all know.

We take the square formed by X.[0..1], Y.[0..1] , throw at random darts at that square ( or generate random reals for X cq Y) and check if the so found points are above or below the function.

After a zillion tries you'll find: Prob(below) = 0.25

Jul-19-08  YouRang: <rinus><If you let 2X be greater than 0 (no upper boundary on 2X cq X) , then your problem will statistically totally float away.>

But you've forgotten why you had the upper bound in the first place.

Without an upper bound, you are left with the task of "randomly selecting a number from an infinite set". It is impossible. :-)

Maybe part (but only part) of our communication problem is that you are thinking of 'real numbers' in a computer sense, while I am thinking of them as they are defined mathematically.

In a computer, there are upper and lower bounds imposed by the hardware, as well as finite precision. Some languages call them 'real' numbers, but mathematically, they are a infinitesimally tiny subset of the rational numbers.

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang> I do think you have a problem too with limits, differentiation, integration and the delta_Dirac_function and above all with pi and sqrt(2).

Now from the obtuse problem:

<A closer look at Carroll’s solution reveals that he indeed made use of uniformity. However, he applied that assumption only to the interior of the region bounded by Figure ABDCE. The computed value of about 0.64 provides the correct answer to a different question.

The correct problem for Carroll’s solution would be:
Given two arbitrary points A and B, a triangle is constructed by choosing a third point at random from the region for which AB is the triangle’s longest side. What is the probability that this triangle is obtuse-angled?>

A Monte Carlo simulation on the reformulated problem would give you the same answer, despite the 'discreteness' of digital reals.

Jul-19-08  YouRang: The question then, is how would one construct an answer to the 2-envelope problem using monte carlo methods?

Personally, I don't think it can be done <properly>. That is, if someone tried, they would necessarily impose some false assumptions, or fail to meet the actual conditions of the stated problem. The 'answer' would thus be distorted.

Jul-19-08
Premium Chessgames Member
  Sneaky: <YouRang> <Perhaps things clear up a little if you consider two *similar* cases, and percieve the difference between them:

CASE #1 -- You hold an envelope containing A dollars.

...

CASE #2 -- There are two envelopes on a table. One of them contains an amount X and the other contains double that amount, 2X. You pick up one of them (depending on the result of coin toss), and call it's amount A, while I take the other other one.

...

Do you see the difference in how A is defined in each case?>

I was sort of hoping for a DIFFERENT example. I mean, Wikipedia claims "this EV formula of the envelope problem is illegitimate". I neither agree nor disagree, but I make a simple request: "Give me an example of an illegitimate EV formula". And you come back with "The envelope problem." Feel my frustration! It's as if this rule about "mixing different instances of a variable or parameter in the same formula" was invented just for the envelope problem, and nothing else?!

Anyhow, to answer your question, sure I see the difference.

In case #1, I snipped out a bunch of what you wrote, on purpose, because it's all irrelevant for the purposes of defining A. You defined A as the the amount of money in the envelope that I'm holding. Period, end of sentence--that's all I needed to know. Then you added < I have another envelope which contains ... bla bla bla yadda yadda yadda>. No problem with having another envelope, you can have a thousand other envelopes, but that doesn't change the definition of A. You also add <You have the option to ... yadda yadda yadda>. Those are the rules of the game; you could have also listed major league baseball rules, but none of that changes the definition that my envelope contains A dollars.

In case #2 you define A identically in the sense that "my envelope contains A". However you also define A in terms of (X,2X). I suppose thats where the value of A starts to take on different characteristics.

And to make matters stranger, if you peek into the envelope and see a specific amount of money, for example $20, then it's no longer a variable. It's reminds me a little bit of Schrödinger's cat: when the observer takes a peek, the wave function collapses.

Wikipedia goes through these laborious steps involving twins, e.g. <Instead, the player's twin sibling opens the other envelope without telling the player the amount it contains>. I appreciate what they are trying to do: by using a twin as an agent, this is somehow designed to blur the line between constants and variables. As if to say "Even if the rules of the game prohibit me from peeking, there's no reason why somebody else can't peek, and once anybody on earth takes a peek the value becomes a constant." Is this clever, or crazy? I've never run into the "twin" construct in mathematics before used for this purpose.

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang> Monte Carlo method

I think it can be done if there's a known upper limit for 2X (let's say 100.000 dollars)

There are two ways to go then; unawareness of the odd problem, or just using the centwise rounding on generated random reals.

I think both ways will reveal the exact amount in the first envelope, which makes it wise to change, and that the amounts will differ at most 1 cent.

Logically must follow that if the meant point is at $38254.47 for a 100.000 dollar maximum for 2X, then it will be $3825.45 for a 10.000 dollar maximum for 2X.

Jul-19-08  YouRang: <Sneaky> From your original post, it wasn't clear (to me anyway), that you wanted a "different" example of an invalid EV formula.

From your post, I got the impression that you didn't see why wikipedia described the 'A' to be "non-constant" in the EV formula: (.5)(A/2) + (.5)(2A) = 1.25A (or what I called case 2).

I hoped to at least illumninate the difference between a valid constant (case 1) and the invalid constant (i.e. non-constant) in case 2.

Apparently I failed or perhaps I misunderstood. Sorry about that.

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang> Now the implementation:

2X(max) = 100.000, generate a random 2X in that domain, with that a random X, and do the rounding.

Put 2X and X random in envelope 1 and 2.

Choose 'change point' at 10.000 dollar, i.e. choose to change if found amount in envelope 1 is below 10,000.

For this change point let the computer run for 10^9 times.

See the EV.

Repeat the whole experiment for 20,000 dollars 'change point'.

etc etc

Jul-19-08  YouRang: <rinus> I think your implementation is describes a different problem.

The maximum amount that might be found in either envelope is 100000, right?

Note then, then when we find a value of 50001 or higher, that it is NEVER a good idea to switch envelopes. The other envelope will always be half (within a penny), because doubling it would exceed the maximum of 100000.

<Addendum to Sneaky> You mentioned that my earlier post was overly verbose, and I'm sure that for your purposes, it was. I filled in the context for the benefit of others who might come along at read it, so they can understand it without having to read through the earlier stuff.

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang> no problems at all

with maximum of 100.000

<change point> 10.000 means if you find more than 10.000 dollars: DON'T CHANGE

If less : CHANGE

**************

<change point> 34.000 means if you find more than 34.000 dollars: DON'T CHANGE

If less : CHANGE

**************

The question is: what is the optimal <change point> ?

Jul-19-08  YouRang: <rinus> Are you planning to do it?

I predict that it will optimal to switch when you have values close to 0, and optimal to not change when you have values close to 100000 (actually, above 50000).

But this won't shine any light on the orginal problem. The original problem had no boundaries. Presumably, no matter what value you saw in your envelope, it has no bearing on whether you should expect the other envelope to contain half that amount or double that amount.

But that's not the case with the implementation that you've proposed.

Jul-19-08
Premium Chessgames Member
  rinus: <YouRang> I will write the program, and then you'll see the difference between no boundaries and boundaries.

As in the obtuse problem too (btw, I've written a program for the given bounded cases in the obtuse problem too, and my results were equivalent to those given in that document).

My prediction is around 35.000 dollars.

The boundaryless problem has the solution: CHANGE ALWAYS

Jul-20-08
Premium Chessgames Member
  rinus: <YouRang> Did run the Monte Carlo simulation.

maximum 2X 100,000 dollar (uniformly distributed)

maximum X 50,000 dollar (uniformly distributed)

minimum for both 0

X and 2X were put randomly in the envelopes.

<change point> if we find an amount of money below this point in envelope 1, we'll switch to envelope 2.

1,000,000 runs per <change point>

Results:

<change point> <expect> <switches>

0.0E+0000 ~~ 37434.28 ~~ 0
1.0E+0004 ~~ 37825.48 ~~ 150453
2.0E+0004 ~~ 38983.36 ~~ 299473
3.0E+0004 ~~ 40843.37 ~~ 450342
4.0E+0004 ~~ 43393.54 ~~ 600422
5.0E+0004 ~~ 46833.16 ~~ 749991
6.0E+0004 ~~ 45484.06 ~~ 799426
7.0E+0004 ~~ 43837.64 ~~ 849979
8.0E+0004 ~~ 41993.62 ~~ 900125
9.0E+0004 ~~ 39834.74 ~~ 950021
1.0E+0005 ~~ 37454.49 ~~ 1000000

As expected 'never change' (<change point> = 0) same expectation as 'always change' (<change point> = 100,000).

Suspicion: optimal <change point> = 50,000

A closer look:

<change point> <expect> <switches>

4.5E+0004 ~~ 44999.72 ~~ 676025
4.6E+0004 ~~ 45353.90 ~~ 690285
4.7E+0004 ~~ 45765.48 ~~ 704507
4.8E+0004 ~~ 46100.14 ~~ 720271
4.9E+0004 ~~ 46462.66 ~~ 734785
5.0E+0004 ~~ 46829.87 ~~ 749939
5.1E+0004 ~~ 46690.40 ~~ 755434
5.2E+0004 ~~ 46622.25 ~~ 759764
5.3E+0004 ~~ 46460.17 ~~ 765786
5.4E+0004 ~~ 46345.87 ~~ 769450
5.5E+0004 ~~ 46168.17 ~~ 775623

Jul-20-08
Premium Chessgames Member
  rinus: Making the program smarter:

Make NO switch if envelope 1 contains $50,000 or more.

<change point> <expect> <switches>

0.0E+0000 ~~ 37462.22 ~~ 0
1.0E+0004 ~~ 37816.94 ~~ 150494
2.0E+0004 ~~ 38959.77 ~~ 300098
3.0E+0004 ~~ 40829.88 ~~ 450391
4.0E+0004 ~~ 43406.67 ~~ 600135
5.0E+0004 ~~ 46819.80 ~~ 750276
6.0E+0004 ~~ 46809.56 ~~ 750359
7.0E+0004 ~~ 46834.78 ~~ 750628
8.0E+0004 ~~ 46800.92 ~~ 750210
9.0E+0004 ~~ 46850.96 ~~ 750494
1.0E+0005 ~~ 46816.97 ~~ 750618

Jul-21-08  sentriclecub: ahah! so it worked?
Jul-21-08  sentriclecub: Will you run your program at a much lower "critical amount of cash" like $250?
Jul-21-08
Premium Chessgames Member
  rinus: <sentriclecub> Replace the dollar with another kind of money; let's say the <sentricle>

1 <sentricle> = 400 dollars

Now the program has the <lower "critical amount of cash" like 250 <sentricles>>

Jul-21-08
Premium Chessgames Member
  Sneaky: <<Addendum to Sneaky> You mentioned that my earlier post was overly verbose, and I'm sure that for your purposes, it was. > Actually I think your writing style is just great, I wanted to emphasize that once you say "I am holding an envelope with A dollars" the job is done -- all that extra stuff about extra envelopes and rules of some game that will presumably be played in the future is totally irrelevant. Not that I mind you mentioning it, but I was just trying to emphasize a point. Sorry if you interpreted me switching your prose for "yadda yadda yadda" the wrong way. :-)

I think we should, from time to time, restate what it is that we are talking about not only for the sake of newcomers to the conversation, but also to keep our own sanity in check.

Jul-21-08
Premium Chessgames Member
  Sneaky: I'm trying to get a handle on this paradox by imagining what it would be like to actually offer the game in a casino setting. I was hoping that I would resolve the paradox but instead it has only amplified in it my mind.

Let's say that the casino version of the game works like this. The player pays some sum of money for the right to play the game. Then the croupier rolls a 6 sided die in secret. The croupier then consults a chart which tells him what sums to put in the envelopes:

1 = (1,2)
2 = (2,4)
3 = (4,8)
4 = (8,16)
5 = (16,32)
6 = (32,64)

The envelopes are then loaded and the player gets to pick one of them. The player then gets to peek in his envelope and choose if he wants to switch or not.

Clearly, the player should always switch if he finds $1 and never switch if he finds $64.

But what if he finds some other value? Say the player finds 16. He now knows that the dealer either rolled a 4 or a 5, and has no reason to believe that one possibility is more likely than the other. There is a 50% chance that the other envelope contains $8, and a 50% chance that the other envelope contains $32.

So if he happens to find $16 then it seems to me that it would perfectly profitable to switch. It fact, it would be foolish not to. The same thing can be said for any figure other than $64.

To put more emotion in this dilemma, let's put it this way. Suppose it was really YOU who was playing this game, your own money is on the line, and suppose you really did pick an envelope with $16 in it. Would YOU switch? What do you want, an automatic $16 or a chance to win either $8 or $32?

Jul-21-08
Premium Chessgames Member
  rinus: <sneaky>

<Would YOU switch? What do you want, an automatic $16 or a chance to win either $8 or $32?>

In this VERY bounded case: SWITCH!

Jul-21-08
Premium Chessgames Member
  Sneaky: <In this VERY bounded case: SWITCH!>

I'd switch too. That's what bothers me. If you wanted the other envelope then why didn't you pick it in the first place? It's like saying, "whichever envelope you pick, chances are almost certain that you'll want to switch it for the other one."

Jump to page #   (enter # from 1 to 58)
search thread:   
< Earlier Kibitzing  · PAGE 44 OF 58 ·  Later Kibitzing>

NOTE: Create an account today to post replies and access other powerful features which are available only to registered users. Becoming a member is free, anonymous, and takes less than 1 minute! If you already have a username, then simply login login under your username now to join the discussion.

Please observe our posting guidelines:

  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, duplicate, or gibberish posts.
  3. No vitriolic or systematic personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No cyberstalking or malicious posting of negative or private information (doxing/doxxing) of members.
  6. No trolling.
  7. The use of "sock puppet" accounts to circumvent disciplinary action taken by moderators, create a false impression of consensus or support, or stage conversations, is prohibited.
  8. Do not degrade Chessgames or any of it's staff/volunteers.

Please try to maintain a semblance of civility at all times.

Blow the Whistle

See something that violates our rules? Blow the whistle and inform a moderator.


NOTE: Please keep all discussion on-topic. This forum is for this specific user only. To discuss chess or this site in general, visit the Kibitzer's Café.

Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
All moderator actions taken are ultimately at the sole discretion of the administration.

You are not logged in to chessgames.com.
If you need an account, register now;
it's quick, anonymous, and free!
If you already have an account, click here to sign-in.

View another user profile:
   
Home | About | Login | Logout | F.A.Q. | Profile | Preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | New Kibitzing | Chessforums | Tournament Index | Player Directory | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | Privacy Notice | Contact Us

Copyright 2001-2025, Chessgames Services LLC