razimantv

# Find the expected number of steps to solve snakes and ladders
# Author: Raziman T V (github.com/razimantv)

import numpy as np

N = 100
snakes_ladders = {
    2: 23, 6: 45, 20: 59, 43: 17, 50: 5, 52: 72, 56: 8, 57: 96, 71: 92,
    73: 15, 84: 63, 87: 49, 98: 40
}

razimantv

razimantv

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
  /* Enter your code here. Read input from STDIN. Print output to STDOUT */  

razimantv

/**
 * Two-Player Split Game Solver
 *
 * This C++ program solves a two-player game played with two hands
 *
 * - Two players take turns, starting with two fingers out on each hand
 * - Each turn, a player can add the number of fingers on one of their hands to
 *   that of their opponent (addition wraps around after 5)
 * - If the numbers on a hand become 5, it resets to 0
 * - If one hand is empty and the other has an even number, it can be split

razimantv

#include <chrono>
#include <iostream>
#include <numeric>
#include <ranges>
#include <vector>

const int N = 10000000;

int main() {
  auto t1 = std::chrono::steady_clock::now();

razimantv

/******************************************************************************
 * File:             towers.cpp
 *
 * Author:           Raziman T V
 * Created:          04/09/20
 * Description:      Solving the Towers puzzle
 *****************************************************************************/

#include <algorithm>
#include <cassert>

razimantv

razimantv

razimantv

#include <fstream>
#include <iostream>
#include <random>
#include <set>
#include <string>
#include <tuple>

// Birth/death events
// If birth: time, +1, 0
// If death: time, -1, birthday

razimantv