Skip to content

Instantly share code, notes, and snippets.

View AlinaWithAFace's full-sized avatar
🍑

Alina Christenbury AlinaWithAFace

🍑
View GitHub Profile
/*
https://www.reddit.com/r/dailyprogrammer/comments/3ofsyb/20151012_challenge_236_easy_random_bag_system/
# Description
Contrary to popular belief, the [tetromino pieces](http://i.imgur.com/65G37Aq.png) you are given in a game of [Tetris](https://en.wikipedia.org/wiki/Tetris) are not randomly selected. Instead, all seven pieces are placed into a "bag." A piece is randomly removed from the bag and presented to the player until the bag is empty. When the bag is empty, it is refilled and the process is repeated for any additional pieces that are needed.
In this way, it is assured that the player will never go too long without seeing a particular piece. It is possible for the player to receive two identical pieces in a row, but never three or more. Your task for today is to implement this system.
# Input Description
@AlinaWithAFace
AlinaWithAFace / [2016-06-13] Challenge #271 [Easy] Critical Hit
Last active June 28, 2016 14:42
[2016-06-13] Challenge #271 [Easy] Critical Hit
/*
https://www.reddit.com/r/dailyprogrammer/comments/4nvrnx/20160613_challenge_271_easy_critical_hit/
Description
Critical hits work a bit differently in this RPG. If you roll the maximum value on a die, you get to roll the die again and add both dice rolls to get your final score. Critical hits can stack indefinitely -- a second max value means you get a third roll, and so on. With enough luck, any number of points is possible.
Input
d -- The number of sides on your die.
h -- The amount of health left on the enemy.
/*
https://goo.gl/z0Rk3j
Written in JavaScript
Background
Back in middle school, I had a peculiar way of dealing with super boring classes. I would take my handy pocket calculator and play a "Game of Threes". Here's how you play it:
First, you mash in a random large number to start with. Then, repeatedly do the following:
If the number is divisible by 3, divide it by 3.
If it's not, either add 1 or subtract 1 (to make it divisible by 3), then divide it by 3.