imporved UI unforently code vanished and got delted still process of fixing
imporved UI unforently code vanished and got delted still process of fixing
A local AI study assistant built with Python, Flask, Hugging Face Transformers and FLAN-T5.
The project can:
The project uses a web-based UI built with Flask, HTML, CSS and JavaScript, allowing the AI features to be accessed through a simple interface.
I also reused and improved flashcard-generation code I had previously built before Stardance existed, rather than rebuilding the feature from scratch. This earlier work became the foundation for the current AI flashcard system.
The project uses:
google/flan-t5-base
through Hugging Face Transformers. The model runs locally, meaning the application does not require a paid AI API.
The flashcard system was improved by:
QUESTION: / ANSWER: outputAI Study Assistant
│
├── Flask UI
├── Document Processing
├── RAG Retrieval
├── Local FLAN-T5 AI
└── Study Tools
├── Q&A
├── Summaries
├── Notes
├── Flashcards
└── Practice Questions
The next stage is integrating the AI system into Frictionless, combining its AI study features with productivity, scheduling and task management.
Fixed bugs and uploaded project to Github pages
Type Bee is a modern, audio-first desktop spelling application built from scratch using Python and Pygame. Inspired by clean digital learning dashboards (such as assignment platforms like Satchel One), it provides an engaging typing practice tool that fetches vocabulary directly from an online 10,000 headwords PDF source.
pyttsx3 text-to-speech engine to read words aloud.requests and pypdf.pyttsx3
Offline text-to-speech pronunciation
Network / Parsing
requests & pypdf
Online PDF stream fetching and text extraction
Concurrency
threading
Non-blocking background data loading
pyttsx3 for automated word pronunciation upon round progression.threading.Thread) to ensure the application window never locks up or reports “Not Responding” while streaming data.Updated the Sudoku game. It now allows users to play the game themself. The other option is to watch the bot solver using the algorithm described in the previous devlog. The next option is to race against the bot. The last option is to quit the game.
For my StarDance project, I decided to work on a Tic-Tac-Toe game that I originally built as part of CS50’s Introduction to Artificial Intelligence with Python.
Instead of leaving it as the original CS50 project, I wanted to develop it further and make it feel more like a proper game.
I took inspiration from the Google Doodle Tic-Tac-Toe game and attempted to recreate some of its ideas and style. I also used PySimpleGUI to create the graphical interface.
The player plays against an AI opponent:
The game has three difficulty levels:
Each level changes how the AI chooses its moves.
The Impossible difficulty uses the Minimax algorithm, which I originally learned about through CS50 AI.
Minimax allows the AI to look at possible future moves and choose the move that gives it the best outcome.
Updated the application to include low CPU memory usage and safety checker options. Below is an image for prompt : make a picture of math student doing math on whiteboard
I have edited the code to now include options to edit the generated image. This has been neatly printed in the command line. The image below is the image generated by the AI. The prompt was to make a Pokémon character
I coded an app called Frictionless. It was an integrated modular life management platform combining AI calendar scheduling, habit tracking, Notion-style block editors, quick link folders, a gamified shopping store, loan tracking, and multi-tiered progress objectives. However, currently the app only works for me in the calendar, but by tomorrow, users will be able to set up their own integration with Google Calendar.
I have built a simple web browser with tabs that can retrieve your search results.
I first built a Sudoku game using Python and Pygame. Sudoku is a number-based logic puzzle played on a 9x9 grid where the goal is to fill every row, column, and 3x3 section with numbers 1 through 9 without repeating any digit.
To make the computer solve puzzles automatically, I built a backtracking solver.
Think of the bot like a person walking through a maze. Since it can’t see the whole maze at once, it has to remember every step it takes. My two stacks (stack_empty and stack_av) act like a trail of breadcrumbs and a list of backup choices at every fork in the road.
Here is how the logic works step-by-step:
Taking a Step Forward:
The bot looks for an empty spot, checks what numbers are allowed using the valid function, and picks the first legal number.
stack_empty) with the spot’s location, and saves its leftover backup numbers in a pocket (stack_av).Hitting a Dead End:
Sometimes, the bot fills up the board, but a later spot gets completely stuck because no numbers are legal.
0.Backtracking (Rewinding):
It looks at its last breadcrumb (stack_empty) and checks its backup pocket (stack_av) to see if it has any untried numbers left for that spot. If that spot is also out of options, it deletes it, erases it back to 0, and steps back even further up the stack.
Once it finds a spot that still has a backup number waiting, it plays that new number and starts moving forward again. In short, the stacks let the bot undo its mistakes one step at a time instead of starting over from scratch!
TradeCraft is officially up and running! The Flask-powered stock market simulator now features secure OTP email authentication, real-time live pricing via yfinance, an interactive trading engine, and dynamic portfolio tracking—giving users a complete, hands-on investing experience from scratch.