bitmasking

Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.

𝗗𝗮𝘁𝗮 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲𝘀 & 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗶𝗻 𝗖/𝗖++ | 𝗘𝗮𝘀𝘆 to 𝗔𝗱𝘃𝗮𝗻𝗰𝗲𝗱 𝗟𝗲𝘃𝗲𝗹

divorcePRED offers an end to end solution from predicting the state of marriage with the help of machine learning, finding like minded people through clustering, emotional analysis through natural language processing and finding optimal routes and therapy centres through graph algorithms.

Convert arrays to bitmask representations to quickly operate with them through bitwise operations. (uses JSBI)

BIT-MAGIC

Framework-agnostic bitmask autotiling engine

Leetcode, Leetcode Solutions, Competitive Programming, Algodesign

All about Competitive Programming

Monte Carlo Tree Search implementation for playing Ultimate Tic Tac Toe

This repository contains algorithms for Competitive Programming as a part of my competitive programming Journey.

A chess engine based on AlphaBeta Pruning search, developed for UCI protocols supported GUIs.

This simple library provides a set of functions for easier life when dealing with bitmasks.

nyt letter boxed solver. uses backtracking and bitmasking to search solutions. generalized for number of sides and characters per side.

solved problems from various websites

Sudoku Solver using Bitmasking + Backtracking and Dancing Links in C

CP work

competitive learner can revise a lot of program and topic from this repo ,here i organised all of my practised and tested code in well manner...

Takes 2 ASCII characters as input and outputs a 21-bit Hamming Code (16-bit code with 5 parity bits) using simple algorithm involving bit-masking.

A high-performance Set Partitioning solver built in Python utilizing Branch and Bound and O(1) bitwise operations to optimize airline crew scheduling.

This Go package allows for the creation of bitmasks of theoretically infinite size.