Tag Info

Bananagrams has a pretty basic set of rules, compared to other games: it seems that the only guidance on this subject is "a legal word is one found in a dictionary (the volume should be agreed upon in advance)". Obviously all your examples can be found in many reasonably good dictionaries. However, I (and most other diehard Scrabble players I'm sure) would ...

I agree, it should have copied Red's guild card for you. I can't think of any reason it shouldn't. I've never used BSW, but I'm assuming it makes this choice automatically. It sounds like a bug to me. I hope their logic isn't looking at the value of the guild card, as scored by the owner, in order to determine which one is best for Olympia. As that would ...

Very simply put, your reasoning is basically right, and you are not alone thinking like this. Does the rule still exist? American Contract Bridge League pages confirm my own personal experience that rubber bridge players often, I'd say always, choose to ignore the rule today (and why): As there is no skill in scoring for honors, players often agree ...

Try this, it's a system called Whole-History Rating. From the abstract: Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whole-history approach is based on the dynamic Bradley-Terry model. But, instead of using ...

We keep score during the game but almost always are off by a few points at the end. It's not always from forgetfulness - it's also possible to bump the score markers. Even when counting at the end it's easy to miss a route or count one twice. So at the end of game, here's what we do: We count one player at a time. For each player: One player will examine ...

I keep track on a piece of paper. Doing this lets you go back anytime during the game to see if a claim was not scored. At the end of the game, if the game scores are close, I'll go back through and double check or re-score the claims. Something like this: Plr1 Plr2 Plr3 2 2 4 4 4 4 4 6 1 5 1 7 ...