Building A Simple Program with C (DiceGame)

 DiceGame by Ashur Baroutta

    Recently I've been learning the basic's of a language new to me, called C. It is actually quite old though the way in which you code with it looks similar to Java. I was tasked with creating a dice game that featured two players rolling until one of them had accumulated 100 or more points. 

The rules for the game are simple, a player rolls 2 dice, if one of the dice is a 1 then the player records a 0 for the round. A player can choose to stand on their points accumulated that round to avoid the risk of rolling a 1 and scoring 0 for the turn. The first to reach a hundred or more wins. There are modifiers for specific scenarios, if a player should roll snake eyes (1 and 1) they score 25 points for that roll and if a player should roll two of the same number, that sum is doubled. 

    In theory, this game shouldn't have been so difficult to code though the way C works isn't the same as modern languages as it uses pointers to update values at the address of a variable in memory. This type of work is automagically completed in most languages I've encountered, so it caused a bit of confusion. The following is a snapshot of the most relevant parts of my code with another picture of its output. 






Comments

Post a Comment

Popular posts from this blog

IP #6 : Reversing an Integer

Image
 Reversing an Integer by Ashur Baroutta     The focus of this submission will be on reversing a given integer passed into our function. Our problem statement is as follows "Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-2^31, 2^31 -1], then return 0." Seems simple, though was actually a little odd. My initial reaction is to convert the integer to a string and then just reverse each character. Though in a way that feels like cheating as I don't think that solution is in the spirit of the assignment,  and it takes more resources to complete.      Pivoting my attention to a mathematical solution made the problem a lot more fun. Say our first example for x is 123. The way we attack it is to setup variables to track the reversed total and to track the remainder of a given iteration, we also create a loop iterating through while x does not equal 0.  The ...
Read more

IP#5 : LinkedList Removing Duplicates II

Image
 Removing Duplicates II by Ashur Baroutta         In our last submissions, we worked on removing duplicates, this week we look at the more complicated problem of the same type. Our problem statement is " Given the  head  of a sorted linked list,  delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list . Return  the linked list  sorted  as well ."      So not only do we have to remove duplicates, but we cannot return values that are not distinct, for example, if our list originally contained three 1's, we need to delete all the 1's in our list as even if we delete all but one of them, the number 1 itself is not a distinct value.      This took me about 3 days to think through and complete, the following is our code submission.  We start by first creating a new ListNode called newlist. We set its .next reference pointing to head (the ListNode passed ini...
Read more