Lemma Soft Forums

xela wrote:I don't understand why this is different from having just the two choices:

Code: Select all

menu:
    "A" if condition_1:
    "B" if condition_1:
    ...
    "K" if condition_3:

For the second part, you need a binding, like a dictionary:

Code: Select all

d = {"A": 0, "B": 0, ...}

when you want to add points to one of the stories, you do:

Code: Select all

d["A"] += 1

When you want to pick the story with the highest score, you get the highest value and jump to whatever key is bound to it (or resolve the jump based of the story letter). You can read about dicts in Tutorials Point, menus in Ren'Py documentation and getting the key off the highest value from a dict on stack overflow.

xela wrote:Dictionaries you can use to track points. "Guys" should be keys and amount of points should be values:

http://www.tutorialspoint.com/python/py ... ionary.htm


Getting the "guy" with the highest points value is explained here:

http://stackoverflow.com/questions/6131 ... y-by-value


Jumping to a new label (starting a path/option) is explained here:

https://www.renpy.org/doc/html/label.html


If statement is explained here a little bit:

https://www.renpy.org/doc/html/quicksta ... statements

or look for the same at Tutorials Point.

===>
Forget the menu bit, I misread your post thinking that you wanted to offer the player choices but now see that you want it to be resolved automatically.

$ condition1

xela wrote:One way would be to rebuild the dict so it only has the choices that belong to condition 1:

Code: Select all

python:
    if condition1:
        temp_dict = {k: d[k] for k in d if k in ["A", "B"]}

then you can get the highest value from the temp dict and you're done. Change the values in ["A", "B"] accordingly, rest of the code can remain the exact same for all of your choices. If you wish to understand what's going on, google: python dict comprehensions.

xela wrote:Everything is spelled out for you in the guides, if you don't want to figure it out for yourself, you are not likely to ever complete a game with logic of any high degree complexity in it...

Code: Select all

init python:
    import operator
    
default story_points = {"A": 1, "B": 23, "C": 11, "D": 3}
default condition_1 = False
default condition_2 = True

label start:
    python:
        if condition_1:
            temp_dict = {k: story_points[k] for k in story_points if k in ["A", "B"]}
        elif condition_2:t
            temp_dict = {k: story_points[k] for k in story_points if k in ["C", "D"]}
            
        highest_score = sorted(temp_dict.items(), key=operator.itemgetter(1))[-1][0]
        
    jump expression highest_score
        
label A:
    "Story A"
    return
    
label B:
    "Story B"
    return
    
label C:
    "Story C"
    return
    
label D:
    "Story D"
    return