Monty Hall problem simulation - written in D (Dlang)

app.d

import std.stdio;
import std.random;
import std.algorithm;


bool make_game(bool change)
{
    static auto list = [1, 2, 3];

    int car = list.choice();
    int guest = list.choice();

    if (change)
    {
        if(guest == car)
            return true;
        else
        {
            list = list.remove!(a => a == guest);
            guest = list.choice();
            return guest == car;
        }
    }
    else
        return guest == car;
}

void main()
{
    immutable bool change = true;
    immutable int times = 100;
    int count = 0;

    foreach(i; 0 .. times)
    {
        if (make_game(change))
            count++;
    }
    writeln(count);
}