Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 4125870
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 20, 20262026-05-20T23:55:34+00:00 2026-05-20T23:55:34+00:00

This is not homework. I’m designing an RPG, and for ability scores I am

  • 0

This is not homework. I’m designing an RPG, and for ability scores I am rolling 4d6, removing the lowest roll, and then adding the remaining total. What I have is below, and I was just curious if anyone had any other better suggestions. For brevity I’ve removed the roll actions, and I just plugged in four integers.

int[] rolls = { 6, 3, 2, 5 };
int abilityScore = rolls[0] + rolls[1] + rolls[2] + rolls[3];
int low = rolls[0];

for (int i = 1; i < rolls.length; i++)
{
    if (rolls[i] < low)
    {
        low = rolls[i];
    }
}

return abilityScore -= low;
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-20T23:55:35+00:00Added an answer on May 20, 2026 at 11:55 pm

    I’d do it like this – no array needed and calculating sum inside the loop:

    int get_total_without_lowest_roll(int roll_count) {
      int abilityScore = 0;
      int low = MAX_INTEGER;
      int roll;
      for (int i = 0; i < roll_count; i++)
      {
        roll = roll_dice(); // Roll your dice here
        if (roll < low)
        {
            low = roll;     
        } // By the way, good alternative would be low = min(low,roll);
        abilityScore += roll;
      }
    
      return (abilityScore - low);
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

This is not homework . I am interested in setting up a simulation of
This is not homework, I need this for my program :) I ask this
Please note that this is not homework and i did search before starting this
To clarify before I begin, this is NOT homework but rather I am studying
This is not exactly homework but it is related to my studies: A grammar
This is not a homework problem. This questions was asked to one of my
this one is not homework, it just the fact that i've been out of
I'm trying to solve this problem, its not a homework question, its just code
well I'm doing this homework but I'm still not viewing the fault... When I
Ok this is a homework questions, but I cannot find the answer anywhere, not

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.