Is it possible to get the largest conceivable score in Hearts?












3














I should explain the necessary rules: in the four-player game of Hearts, the object is to get as few points as possible. The points you receive are determined by the cards you pick up through a hand: hearts are worth $1$ point each, and the queen of spades is worth $13$ points. Players can thus receive any score between 0 and 25 on a given hand. However, if on a hand a player obtains all 13 hearts and the queen of spades, then that player receives $0$ points and all other players receive $26$ points, an act referred to as "shooting the moon".



The game ends when a player exceeds $100$ points, at which point the player with the fewest points is the winner. In this way, the best conceivable score is



$$
begin{matrix}0&99&99&99end{matrix} → begin{matrix}0&125&125&125end{matrix}
$$



My question is, is this score possible? And, more generally, how can one determine whether any given score in Hearts is possible?



As best I can tell, we must determine whether $left[begin{matrix}99\99\99end{matrix}right]$ is a linear combination of all the possible final scores.



I would lean towards the idea that this is not possible; it is simple to produce even multiples of 13:



$$
begin{matrix}0&0&13&13 \ 0&13&26&13 \ 0&26&26&26end{matrix}
$$



But I cannot think of a good way to produce any given score.










share|cite|improve this question


















  • 3




    After each hand, the sum of all the scores must be a multiple of $26$.
    – vadim123
    Nov 2 '14 at 20:50










  • I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
    – Peter
    Nov 2 '14 at 20:53












  • @Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
    – vadim123
    Nov 2 '14 at 20:53






  • 1




    @Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
    – EMBLEM
    Nov 2 '14 at 20:54










  • @vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
    – EMBLEM
    Nov 2 '14 at 20:54
















3














I should explain the necessary rules: in the four-player game of Hearts, the object is to get as few points as possible. The points you receive are determined by the cards you pick up through a hand: hearts are worth $1$ point each, and the queen of spades is worth $13$ points. Players can thus receive any score between 0 and 25 on a given hand. However, if on a hand a player obtains all 13 hearts and the queen of spades, then that player receives $0$ points and all other players receive $26$ points, an act referred to as "shooting the moon".



The game ends when a player exceeds $100$ points, at which point the player with the fewest points is the winner. In this way, the best conceivable score is



$$
begin{matrix}0&99&99&99end{matrix} → begin{matrix}0&125&125&125end{matrix}
$$



My question is, is this score possible? And, more generally, how can one determine whether any given score in Hearts is possible?



As best I can tell, we must determine whether $left[begin{matrix}99\99\99end{matrix}right]$ is a linear combination of all the possible final scores.



I would lean towards the idea that this is not possible; it is simple to produce even multiples of 13:



$$
begin{matrix}0&0&13&13 \ 0&13&26&13 \ 0&26&26&26end{matrix}
$$



But I cannot think of a good way to produce any given score.










share|cite|improve this question


















  • 3




    After each hand, the sum of all the scores must be a multiple of $26$.
    – vadim123
    Nov 2 '14 at 20:50










  • I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
    – Peter
    Nov 2 '14 at 20:53












  • @Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
    – vadim123
    Nov 2 '14 at 20:53






  • 1




    @Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
    – EMBLEM
    Nov 2 '14 at 20:54










  • @vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
    – EMBLEM
    Nov 2 '14 at 20:54














3












3








3







I should explain the necessary rules: in the four-player game of Hearts, the object is to get as few points as possible. The points you receive are determined by the cards you pick up through a hand: hearts are worth $1$ point each, and the queen of spades is worth $13$ points. Players can thus receive any score between 0 and 25 on a given hand. However, if on a hand a player obtains all 13 hearts and the queen of spades, then that player receives $0$ points and all other players receive $26$ points, an act referred to as "shooting the moon".



The game ends when a player exceeds $100$ points, at which point the player with the fewest points is the winner. In this way, the best conceivable score is



$$
begin{matrix}0&99&99&99end{matrix} → begin{matrix}0&125&125&125end{matrix}
$$



My question is, is this score possible? And, more generally, how can one determine whether any given score in Hearts is possible?



As best I can tell, we must determine whether $left[begin{matrix}99\99\99end{matrix}right]$ is a linear combination of all the possible final scores.



I would lean towards the idea that this is not possible; it is simple to produce even multiples of 13:



$$
begin{matrix}0&0&13&13 \ 0&13&26&13 \ 0&26&26&26end{matrix}
$$



But I cannot think of a good way to produce any given score.










share|cite|improve this question













I should explain the necessary rules: in the four-player game of Hearts, the object is to get as few points as possible. The points you receive are determined by the cards you pick up through a hand: hearts are worth $1$ point each, and the queen of spades is worth $13$ points. Players can thus receive any score between 0 and 25 on a given hand. However, if on a hand a player obtains all 13 hearts and the queen of spades, then that player receives $0$ points and all other players receive $26$ points, an act referred to as "shooting the moon".



The game ends when a player exceeds $100$ points, at which point the player with the fewest points is the winner. In this way, the best conceivable score is



$$
begin{matrix}0&99&99&99end{matrix} → begin{matrix}0&125&125&125end{matrix}
$$



My question is, is this score possible? And, more generally, how can one determine whether any given score in Hearts is possible?



As best I can tell, we must determine whether $left[begin{matrix}99\99\99end{matrix}right]$ is a linear combination of all the possible final scores.



I would lean towards the idea that this is not possible; it is simple to produce even multiples of 13:



$$
begin{matrix}0&0&13&13 \ 0&13&26&13 \ 0&26&26&26end{matrix}
$$



But I cannot think of a good way to produce any given score.







card-games






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 2 '14 at 20:48









EMBLEM

1185




1185








  • 3




    After each hand, the sum of all the scores must be a multiple of $26$.
    – vadim123
    Nov 2 '14 at 20:50










  • I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
    – Peter
    Nov 2 '14 at 20:53












  • @Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
    – vadim123
    Nov 2 '14 at 20:53






  • 1




    @Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
    – EMBLEM
    Nov 2 '14 at 20:54










  • @vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
    – EMBLEM
    Nov 2 '14 at 20:54














  • 3




    After each hand, the sum of all the scores must be a multiple of $26$.
    – vadim123
    Nov 2 '14 at 20:50










  • I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
    – Peter
    Nov 2 '14 at 20:53












  • @Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
    – vadim123
    Nov 2 '14 at 20:53






  • 1




    @Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
    – EMBLEM
    Nov 2 '14 at 20:54










  • @vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
    – EMBLEM
    Nov 2 '14 at 20:54








3




3




After each hand, the sum of all the scores must be a multiple of $26$.
– vadim123
Nov 2 '14 at 20:50




After each hand, the sum of all the scores must be a multiple of $26$.
– vadim123
Nov 2 '14 at 20:50












I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
– Peter
Nov 2 '14 at 20:53






I am confused. The goal is to get as few points as possible, or not ? And if a heart counts 1 point, any score should be possible. You probably mean the highest possible score instead of the best score.
– Peter
Nov 2 '14 at 20:53














@Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
– vadim123
Nov 2 '14 at 20:53




@Peter, there are 26 points awarded total, between all the players, if the moon is not shot. If it is shot, then the total number of points awarded is a multiple of 26.
– vadim123
Nov 2 '14 at 20:53




1




1




@Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
– EMBLEM
Nov 2 '14 at 20:54




@Peter The "best possible score" I gave is the highest possible winning margin for the player with 0.
– EMBLEM
Nov 2 '14 at 20:54












@vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
– EMBLEM
Nov 2 '14 at 20:54




@vadim123 Well, that was trivially easy. Put that into an answer and I'll accept it.
– EMBLEM
Nov 2 '14 at 20:54










2 Answers
2






active

oldest

votes


















1














After each hand, the sum of all the scores must be a multiple of 26.






share|cite|improve this answer





















  • But that does not answer the question : what is the best possible performance for the winner ?
    – Peter
    Nov 2 '14 at 20:57










  • I do not think that it is $0-104-104-104$
    – Peter
    Nov 2 '14 at 20:58






  • 1




    @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
    – EMBLEM
    Nov 2 '14 at 21:00












  • $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
    – Peter
    Nov 2 '14 at 21:06






  • 1




    @Peter the sum of both our scores is still 286, so the margin is unchanged.
    – EMBLEM
    Nov 2 '14 at 21:08



















1














Suppose we have four desired scores $a_1, a_2, a_3, a_4$, with $a_1+a_2+a_3+a_4=26k$. Then I claim that the scores are attainable if and only if
$$
lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor geq k tag{*}
$$



To see this, suppose first that nobody ever shoots the moon. Then we played $k$ hands, and so the queen of spades must have come up $k$ times. On the other hand, a player who scored $a$ points can have received the queen of spades at most $lfloor a/13 rfloor$ times, which shows that $(*)$ is necessary. Conversely, if $(*)$ holds, we can distribute the $k$ queens of spades among the four players in any way that doesn't cause their score to get too big, and fill in all the gaps with hearts.



Now, suppose $l$ hands involve people shooting the moon. Those hands have a total score of $3(26)=78$, while the remaining hands have a total score of $26$; thus the number of normally-scored hands is $k-3l$. Also suppose player $i$ shot the moon $s_i$ times. Then applying $(*)$ to the unshot hands gives



begin{align}
k-3l leq &lfloor a_1/13rfloor-2(s_2+s_3+s_4)+lfloor a_2/13rfloor-2(s_1+s_3+s_4)\&quad+lfloor a_3/13rfloor-2(s_1+s_2+s_4)+lfloor a_4/13rfloor-2(s_1+s_2+s_3)\=&lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-6l
end{align}
or equivalently
$$
lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-3l geq k
$$
which is a strictly stronger condition than $(*)$ for $l>0$.



Note in particular that, if every player's score is either $0$ or at least $13$, then $(*)$ must hold: in that case rounding down to a multiple of $13$ cannot take away more than half of any score, and so cannot take away more than half of the total. This provides a quick way of seeing that the scores in the comments to @vadim123's answer are actually attainable.





Although the OP's rules are the standard rules, a lot of people instead play that shooting the moon loses you $26$ points. In this variant, any set of scores whose sum is a multiple of $26$ is attainable, as the last inequality becomes
$$
lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor+l geq k
$$
so we just have to make $l$ sufficiently large. (Intuitively, if everyone starts by shooting the moon a whole bunch, they'll have enough room to arrange their scores however they like.)






share|cite|improve this answer























    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1003149%2fis-it-possible-to-get-the-largest-conceivable-score-in-hearts%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1














    After each hand, the sum of all the scores must be a multiple of 26.






    share|cite|improve this answer





















    • But that does not answer the question : what is the best possible performance for the winner ?
      – Peter
      Nov 2 '14 at 20:57










    • I do not think that it is $0-104-104-104$
      – Peter
      Nov 2 '14 at 20:58






    • 1




      @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
      – EMBLEM
      Nov 2 '14 at 21:00












    • $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
      – Peter
      Nov 2 '14 at 21:06






    • 1




      @Peter the sum of both our scores is still 286, so the margin is unchanged.
      – EMBLEM
      Nov 2 '14 at 21:08
















    1














    After each hand, the sum of all the scores must be a multiple of 26.






    share|cite|improve this answer





















    • But that does not answer the question : what is the best possible performance for the winner ?
      – Peter
      Nov 2 '14 at 20:57










    • I do not think that it is $0-104-104-104$
      – Peter
      Nov 2 '14 at 20:58






    • 1




      @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
      – EMBLEM
      Nov 2 '14 at 21:00












    • $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
      – Peter
      Nov 2 '14 at 21:06






    • 1




      @Peter the sum of both our scores is still 286, so the margin is unchanged.
      – EMBLEM
      Nov 2 '14 at 21:08














    1












    1








    1






    After each hand, the sum of all the scores must be a multiple of 26.






    share|cite|improve this answer












    After each hand, the sum of all the scores must be a multiple of 26.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 2 '14 at 20:55









    vadim123

    75.3k896187




    75.3k896187












    • But that does not answer the question : what is the best possible performance for the winner ?
      – Peter
      Nov 2 '14 at 20:57










    • I do not think that it is $0-104-104-104$
      – Peter
      Nov 2 '14 at 20:58






    • 1




      @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
      – EMBLEM
      Nov 2 '14 at 21:00












    • $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
      – Peter
      Nov 2 '14 at 21:06






    • 1




      @Peter the sum of both our scores is still 286, so the margin is unchanged.
      – EMBLEM
      Nov 2 '14 at 21:08


















    • But that does not answer the question : what is the best possible performance for the winner ?
      – Peter
      Nov 2 '14 at 20:57










    • I do not think that it is $0-104-104-104$
      – Peter
      Nov 2 '14 at 20:58






    • 1




      @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
      – EMBLEM
      Nov 2 '14 at 21:00












    • $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
      – Peter
      Nov 2 '14 at 21:06






    • 1




      @Peter the sum of both our scores is still 286, so the margin is unchanged.
      – EMBLEM
      Nov 2 '14 at 21:08
















    But that does not answer the question : what is the best possible performance for the winner ?
    – Peter
    Nov 2 '14 at 20:57




    But that does not answer the question : what is the best possible performance for the winner ?
    – Peter
    Nov 2 '14 at 20:57












    I do not think that it is $0-104-104-104$
    – Peter
    Nov 2 '14 at 20:58




    I do not think that it is $0-104-104-104$
    – Peter
    Nov 2 '14 at 20:58




    1




    1




    @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
    – EMBLEM
    Nov 2 '14 at 21:00






    @Peter I found through some brief trial and error that the highest possible winning margin is $begin{matrix}0&95&95&96end{matrix} → begin{matrix}0&121&121&122end{matrix}$.
    – EMBLEM
    Nov 2 '14 at 21:00














    $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
    – Peter
    Nov 2 '14 at 21:06




    $0-78-78-78$ $0-79-82-99$ $0-99-88-99$ $0-125-114-125$. What about that ?
    – Peter
    Nov 2 '14 at 21:06




    1




    1




    @Peter the sum of both our scores is still 286, so the margin is unchanged.
    – EMBLEM
    Nov 2 '14 at 21:08




    @Peter the sum of both our scores is still 286, so the margin is unchanged.
    – EMBLEM
    Nov 2 '14 at 21:08











    1














    Suppose we have four desired scores $a_1, a_2, a_3, a_4$, with $a_1+a_2+a_3+a_4=26k$. Then I claim that the scores are attainable if and only if
    $$
    lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor geq k tag{*}
    $$



    To see this, suppose first that nobody ever shoots the moon. Then we played $k$ hands, and so the queen of spades must have come up $k$ times. On the other hand, a player who scored $a$ points can have received the queen of spades at most $lfloor a/13 rfloor$ times, which shows that $(*)$ is necessary. Conversely, if $(*)$ holds, we can distribute the $k$ queens of spades among the four players in any way that doesn't cause their score to get too big, and fill in all the gaps with hearts.



    Now, suppose $l$ hands involve people shooting the moon. Those hands have a total score of $3(26)=78$, while the remaining hands have a total score of $26$; thus the number of normally-scored hands is $k-3l$. Also suppose player $i$ shot the moon $s_i$ times. Then applying $(*)$ to the unshot hands gives



    begin{align}
    k-3l leq &lfloor a_1/13rfloor-2(s_2+s_3+s_4)+lfloor a_2/13rfloor-2(s_1+s_3+s_4)\&quad+lfloor a_3/13rfloor-2(s_1+s_2+s_4)+lfloor a_4/13rfloor-2(s_1+s_2+s_3)\=&lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-6l
    end{align}
    or equivalently
    $$
    lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-3l geq k
    $$
    which is a strictly stronger condition than $(*)$ for $l>0$.



    Note in particular that, if every player's score is either $0$ or at least $13$, then $(*)$ must hold: in that case rounding down to a multiple of $13$ cannot take away more than half of any score, and so cannot take away more than half of the total. This provides a quick way of seeing that the scores in the comments to @vadim123's answer are actually attainable.





    Although the OP's rules are the standard rules, a lot of people instead play that shooting the moon loses you $26$ points. In this variant, any set of scores whose sum is a multiple of $26$ is attainable, as the last inequality becomes
    $$
    lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor+l geq k
    $$
    so we just have to make $l$ sufficiently large. (Intuitively, if everyone starts by shooting the moon a whole bunch, they'll have enough room to arrange their scores however they like.)






    share|cite|improve this answer




























      1














      Suppose we have four desired scores $a_1, a_2, a_3, a_4$, with $a_1+a_2+a_3+a_4=26k$. Then I claim that the scores are attainable if and only if
      $$
      lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor geq k tag{*}
      $$



      To see this, suppose first that nobody ever shoots the moon. Then we played $k$ hands, and so the queen of spades must have come up $k$ times. On the other hand, a player who scored $a$ points can have received the queen of spades at most $lfloor a/13 rfloor$ times, which shows that $(*)$ is necessary. Conversely, if $(*)$ holds, we can distribute the $k$ queens of spades among the four players in any way that doesn't cause their score to get too big, and fill in all the gaps with hearts.



      Now, suppose $l$ hands involve people shooting the moon. Those hands have a total score of $3(26)=78$, while the remaining hands have a total score of $26$; thus the number of normally-scored hands is $k-3l$. Also suppose player $i$ shot the moon $s_i$ times. Then applying $(*)$ to the unshot hands gives



      begin{align}
      k-3l leq &lfloor a_1/13rfloor-2(s_2+s_3+s_4)+lfloor a_2/13rfloor-2(s_1+s_3+s_4)\&quad+lfloor a_3/13rfloor-2(s_1+s_2+s_4)+lfloor a_4/13rfloor-2(s_1+s_2+s_3)\=&lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-6l
      end{align}
      or equivalently
      $$
      lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-3l geq k
      $$
      which is a strictly stronger condition than $(*)$ for $l>0$.



      Note in particular that, if every player's score is either $0$ or at least $13$, then $(*)$ must hold: in that case rounding down to a multiple of $13$ cannot take away more than half of any score, and so cannot take away more than half of the total. This provides a quick way of seeing that the scores in the comments to @vadim123's answer are actually attainable.





      Although the OP's rules are the standard rules, a lot of people instead play that shooting the moon loses you $26$ points. In this variant, any set of scores whose sum is a multiple of $26$ is attainable, as the last inequality becomes
      $$
      lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor+l geq k
      $$
      so we just have to make $l$ sufficiently large. (Intuitively, if everyone starts by shooting the moon a whole bunch, they'll have enough room to arrange their scores however they like.)






      share|cite|improve this answer


























        1












        1








        1






        Suppose we have four desired scores $a_1, a_2, a_3, a_4$, with $a_1+a_2+a_3+a_4=26k$. Then I claim that the scores are attainable if and only if
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor geq k tag{*}
        $$



        To see this, suppose first that nobody ever shoots the moon. Then we played $k$ hands, and so the queen of spades must have come up $k$ times. On the other hand, a player who scored $a$ points can have received the queen of spades at most $lfloor a/13 rfloor$ times, which shows that $(*)$ is necessary. Conversely, if $(*)$ holds, we can distribute the $k$ queens of spades among the four players in any way that doesn't cause their score to get too big, and fill in all the gaps with hearts.



        Now, suppose $l$ hands involve people shooting the moon. Those hands have a total score of $3(26)=78$, while the remaining hands have a total score of $26$; thus the number of normally-scored hands is $k-3l$. Also suppose player $i$ shot the moon $s_i$ times. Then applying $(*)$ to the unshot hands gives



        begin{align}
        k-3l leq &lfloor a_1/13rfloor-2(s_2+s_3+s_4)+lfloor a_2/13rfloor-2(s_1+s_3+s_4)\&quad+lfloor a_3/13rfloor-2(s_1+s_2+s_4)+lfloor a_4/13rfloor-2(s_1+s_2+s_3)\=&lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-6l
        end{align}
        or equivalently
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-3l geq k
        $$
        which is a strictly stronger condition than $(*)$ for $l>0$.



        Note in particular that, if every player's score is either $0$ or at least $13$, then $(*)$ must hold: in that case rounding down to a multiple of $13$ cannot take away more than half of any score, and so cannot take away more than half of the total. This provides a quick way of seeing that the scores in the comments to @vadim123's answer are actually attainable.





        Although the OP's rules are the standard rules, a lot of people instead play that shooting the moon loses you $26$ points. In this variant, any set of scores whose sum is a multiple of $26$ is attainable, as the last inequality becomes
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor+l geq k
        $$
        so we just have to make $l$ sufficiently large. (Intuitively, if everyone starts by shooting the moon a whole bunch, they'll have enough room to arrange their scores however they like.)






        share|cite|improve this answer














        Suppose we have four desired scores $a_1, a_2, a_3, a_4$, with $a_1+a_2+a_3+a_4=26k$. Then I claim that the scores are attainable if and only if
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor geq k tag{*}
        $$



        To see this, suppose first that nobody ever shoots the moon. Then we played $k$ hands, and so the queen of spades must have come up $k$ times. On the other hand, a player who scored $a$ points can have received the queen of spades at most $lfloor a/13 rfloor$ times, which shows that $(*)$ is necessary. Conversely, if $(*)$ holds, we can distribute the $k$ queens of spades among the four players in any way that doesn't cause their score to get too big, and fill in all the gaps with hearts.



        Now, suppose $l$ hands involve people shooting the moon. Those hands have a total score of $3(26)=78$, while the remaining hands have a total score of $26$; thus the number of normally-scored hands is $k-3l$. Also suppose player $i$ shot the moon $s_i$ times. Then applying $(*)$ to the unshot hands gives



        begin{align}
        k-3l leq &lfloor a_1/13rfloor-2(s_2+s_3+s_4)+lfloor a_2/13rfloor-2(s_1+s_3+s_4)\&quad+lfloor a_3/13rfloor-2(s_1+s_2+s_4)+lfloor a_4/13rfloor-2(s_1+s_2+s_3)\=&lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-6l
        end{align}
        or equivalently
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor-3l geq k
        $$
        which is a strictly stronger condition than $(*)$ for $l>0$.



        Note in particular that, if every player's score is either $0$ or at least $13$, then $(*)$ must hold: in that case rounding down to a multiple of $13$ cannot take away more than half of any score, and so cannot take away more than half of the total. This provides a quick way of seeing that the scores in the comments to @vadim123's answer are actually attainable.





        Although the OP's rules are the standard rules, a lot of people instead play that shooting the moon loses you $26$ points. In this variant, any set of scores whose sum is a multiple of $26$ is attainable, as the last inequality becomes
        $$
        lfloor a_1/13rfloor+lfloor a_2/13rfloor+lfloor a_3/13rfloor+lfloor a_4/13rfloor+l geq k
        $$
        so we just have to make $l$ sufficiently large. (Intuitively, if everyone starts by shooting the moon a whole bunch, they'll have enough room to arrange their scores however they like.)







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Nov 2 '14 at 22:03

























        answered Nov 2 '14 at 21:34









        Micah

        29.6k1363105




        29.6k1363105






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1003149%2fis-it-possible-to-get-the-largest-conceivable-score-in-hearts%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Probability when a professor distributes a quiz and homework assignment to a class of n students.

            Aardman Animations

            Are they similar matrix