Timeline for A Python Blackjack terminal based game
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2019 at 13:54 | comment | added | Aleksandr Hovhannisyan | Oh, no, to clarify, what I meant is that using indices to get the card values does not consistently make sense. For values 2-10, it's a matter of values[n-1] = card with value of n. But the Ace is an exception to this rule, so I wanted to emphasize that a map would make this even clearer. | |
| May 27, 2019 at 13:04 | vote | accept | fames | ||
| May 27, 2019 at 12:58 | history | edited | Aleksandr Hovhannisyan | CC BY-SA 4.0 | added 539 characters in body |
| May 27, 2019 at 10:12 | comment | added | PiCTo | in the case of Ace = 11, simply doesn't make sense: I believe that this is so that comparators (>, <, ...) give the ace the highest in-game value. | |
| May 26, 2019 at 14:52 | history | answered | Aleksandr Hovhannisyan | CC BY-SA 4.0 |