Mindless Setback

  •        70

Setback is a card game popular in New England. This project uses a combination of brute force and Monte Carlo methods to play Setback. This is an experimental approach to playing cards and other games where incomplete information is available.

http://msetback.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

idle_master - Get your Steam Trading Cards the Easy Way


This program will determine which of your Steam games still have Steam Trading Card drops remaining, and will go through each application to simulate you being “in-game” so that cards will drop. It will check periodically to see if the game you’re idling has card drops remaining. When only one drop remains, it will start checking more frequently. When the game you’re idling has no more cards, it’ll move on to the next game. When no more cards are available, the program will terminate. This project has been discontinued, no further bug fixes or changes will be made. Issues and pull requests will be ignored. The program should still work (as of Jan 3, 2018) but Valve may make a change that causes the program to become non-functioning at any time. There are a multitude of forks of this project that are being currently maintained.

Monte Carlo Baseball Simulation


A Monte Carlo simulation of Major League Baseball(TM), used to find the best strategies in a baseball game. The effect of different batting orders and the addition of one super-star can be tested and archived in retrosheet format.

idle_master_py - The Python version of Idle Master


This program will determine which of your Steam games still have Steam Trading Card drops remaining, and will go through each application to simulate you being “in-game” so that cards will drop. It will check periodically to see if the game you’re idling has card drops remaining. When only one drop remains, it will start checking more frequently. When the game you’re idling has no more cards, it’ll move on to the next game. When no more cards are available, the program will terminate. This is the Python repository which is helpful for user running the application on non-Windows operating systems or those having trouble getting the newest version of Idle Master for Windows to run correctly.

McCloud Service Framework


Monte Carlo Cloud Service Framework (McCloud) provides a generic service implementation of Monte Carlo method, based on Microsoft Windows Azure, to solve a wide range of scientific and engineering problems.

MCS-libre Monte-Carlo Simulation Toolkit


Free C++ toolkit to facilitate Monte-Carlo simulation. This is a library covered under the LGPL. quot;MCS-librequot; stands for quot;Monte Carlo Simulation - librequot;. Documentation and examples are provided.


deck-of-cards - HTML5 Deck of Cards


Pure vanilla JS (+ CSS3) – no dependencies, by Juha Lindstedt & contributors. Frontside card graphics are slightly modified from Chris Aguilar's awesome Vector Playing Card Graphics Set.

express-brute - Brute-force protection middleware for express routes by rate limiting incoming requests


A brute-force protection middleware for express routes that rate-limits incoming requests, increasing the delay with each request in a fibonacci-like sequence. An in-memory store for persisting request counts. Don't use this in production, instead choose one of the more robust store implementations listed below.

ionic-ion-swipe-cards - Swipeable card based layout for Ionic and Angular


Include `ionic.swipecards.js` after the rest of your Ionic and Angular includes. Then use the following AngularJS directives:```html<swipe-cards> <swipe-card ng-repeat="card in cards" on-destroy="cardDestroyed($index)" on-card-swipe="cardSwiped($index)"> Card content here </swipe-card></swipe-cards>```To add new cards dynamically, just add them to the cards array:```javascript$scope.cards = [ { // card 1 }, { // card 2 }];$scope.cardDestroyed = function(index) { $scope.cards.splice(index

PAiRS - A WPF Memory Card Game


PAiRS is an implementation of a card matching game in which you are given an even number of cards face down in a grid, and you try to flip over 2 cards at a time to create a match until all cards are matched. PAiRS is built using C#, .Net 3.5+ and WPF.

PlayingCards - A C# Playing Card Library


This is a C# playing card library, and an included sample game. The game is meant to be a networked virtual card table where folks can play just about any kind of card game they would like. For now, the game is not playable, but more of a test of the library. Hope you enjoy.

MCCCS Towhee


Towhee is a Monte Carlo molecular simulation code originally designed for the prediction of fluid phase equilibria using atom-based force fields and the Gibbs ensemble with particular attention paid to algorithms addressing molecule conformation sampling.

rethinking - Statistical Rethinking course and book package


This R package accompanies a course and book on Bayesian data analysis (McElreath 2016. Statistical Rethinking. CRC Press.). It contains tools for conducting both MAP estimation and Hamiltonian Monte Carlo (through RStan - mc-stan.org). These tools force the user to specify the model as a list of explicit distributional assumptions. This is more tedious than typical formula-based tools, but it is also much more flexible and powerful. The first formula in the list is the likelihood; the second is the prior for mu; the third is the prior for sigma (implicitly a half-Cauchy, due to positive constraint on sigma).

alpha-zero-general - A clean implementation based on AlphaZero for any game in any framework + tutorial + Othello/Gobang/TicTacToe/Connect4


A simplified, highly flexible, commented and (hopefully) easy to understand implementation of self-play based reinforcement learning based on the AlphaGo Zero paper (Silver et al). It is designed to be easy to adopt for any two-player turn-based adversarial game and any deep learning framework of your choice. A sample implementation has been provided for the game of Othello in PyTorch, Keras and TensorFlow. An accompanying tutorial can be found here. We also have implementations for GoBang and TicTacToe. To use a game of your choice, subclass the classes in Game.py and NeuralNet.py and implement their functions. Example implementations for Othello can be found in othello/OthelloGame.py and othello/{pytorch,keras,tensorflow}/NNet.py.

credential - Easy password hashing and verification in Node


Easy password hashing and verification in Node. Protects against brute force, rainbow tables, and timing attacks.Employs cryptographically secure, per password salts to prevent rainbow table attacks. Key stretching is used to make brute force attacks impractical. A constant time verification check prevents variable response time attacks.

BruteX - Automatically brute force all services running on a target.


This software is free to distribute, modify and use with the condition that credit is provided to the creator (1N3@CrowdShield) and is not for commercial use. Donations are welcome. This will help fascilitate improved features, frequent updates and better overall support for sniper.

Quameon - Quantum Monte Carlo in Python


Quantum Monte Carlo algorithms expressed in Python. This code calculates electronic properties of atoms and molecules from first principles.

Monte Carlo eXtreme (MCX)


MCX is a Monte Carlo simulation software for static or time-resolved photon transport in 3D media. It uses GPU-based massively parallel computing techniques and is extremely fast compared to the traditional single-threaded CPU-based simulations.

Monte Carlo Analysis for MS Project


Monte Carlo analysis is an enhancement to CPM and PERT methods built into MS Project. It enables project manager to run statistical simulation of possible project outcomes based on optimistic, pessimistic and most likely estimates.

ForcePlot


Force plot is a user friendly graphing calculator which uses brute-force computing. It can plot difficult equations that many popular programs cannot plot.

C-cards development


C-cards: it is a simple card game, where cards are computational elements; computing machines can be defined, built and animated in a concrete way by disposing cards and moving pegs around them, following formal rules.