anshaneel Goto Github PK

agressive-store-bots

A repository focused on Automated Bot's that will auto purchase products on a store's website. I currently have 3 bot's for Amazon, Bestbuy, and Newegg.

anshaneel

Config files for my GitHub profile.

b07lab1

Lab1 for CSCB07

b09

b09-a2

Assignment 2: Recreating the System-Wide FD Tables

b09-a3

b09_a1

b63-a1

b63-a2

MinHeap Immplementation

bayesian-networks-for-options-hedging-strategies

Exploring portfolio hedging optimization using Bayesian Networks' advanced probabilistic modeling.

cobuild

final-project-s23-p-pioneers created by GitHub Classroom

dynamic-neural-network-ensemble-for-hft

Harnessing Multiple Models for Adaptive Market Predictions and Risk Management

example-scripts

The official example scripts for the Numerai Data Science Tournament

leetcode

My solutions to Leetcode questions

neuroevolution-of-augmenting-topologies

Using genetic algorithms to rival fix topology networks and comparing the results

resume

This is my current Resume along with changes made over time

sorta-super-mario

tic-tac-toe-ai

For my final project in the ICS4U course, I have created an advanced Tic Tac Toe Ai in Java which my teacher has said was one of the most amazing final projects she had ever seen. Using methods of recursion I created an Ai that can play Tic Tac Toe in various difficulties, the hardest one being impossible to defeat. This program consists of -Starting menu -Options to play against human or computer (one or two-player modes) -Options to choose which player goes first -Difficulties to choose between -Scoreboard -Prompts to indicate if the user won or lost this project uses the concepts of an advanced algorithm called minimax which determines every possible outcome of the game and chooses its move accordingly. Difficulties (for Ai) Easy- Randomly chooses any unselected spot on the board, can be easily outmaneuvered. Medium- Utilizes minimax function but not to the fullest extent can be outmaneuvered sometimes. Impossible- Utilizes the minimax algorithm to the fullest extent, cannot be outmaneuvered. Next Steps This project was created in a very limited timeframe and although I was very happy with how it turned out there is always room for improvement. These are a few things I would have liked to add -Music/ Sound effects -Alpha-beta pruning for the minimax algorithm Hope this helps