Bada minesweeper Files

Brought to you by: khanhnam

The interactive file manager requires Javascript. Please enable it or use sftp or scp.
You may still browse the files here.

Name	Modified	Size	InfoDownloads / Week
Parent folder
IDF_MENUFORM.xml	2010-11-10	2.2 kB	0
IDF_MAINFORM.xml	2010-11-10	618 Bytes	0
IDF_HIGHSCOREFORM.xml	2010-11-10	1.0 kB	0
IDF_ENTERNAMEFORM.xml	2010-11-10	1.9 kB	0
Totals: 4 Items		5.8 kB	0

Other Useful Business Software

Build Securely on Azure with Proven Frameworks

Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.

Download Now

Forever Free Full-Stack Observability | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.

Create free account

Forever Free Full-Stack Observability | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Create free account

Recommended Projects

minesweeper
Modern Minesweeper clone for Windows and Linux
MineSweeper Pygame
Simple minesweeper game in python
Minesweeper
The classic game: Minesweeper
Minesweeper
Minesweeper proggt by rdh
PrevToNextFill (1-2-3 Fill)
1-2-3 Feel is a simple clicking timekilling game for those, who like minesweeper and various loops games. Goal: fill all field. Rules: For number <i> you can move only from <i> to <i+1>. You can move only from reached points to not reached.