Skip to content

Algorithm developed for the research paper “Lights Out on Nearly Complete Graphs”

Notifications You must be signed in to change notification settings

riyagoyal2134/LightsOut

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 

Repository files navigation

LightsOut

Table of contents

General info

The purpose of this project is to estimate the probability of winning the game Lights Out on a random graph for n vertices and e edges. The project generates a random graph using the algorithm presented by Nicholas C. Wormald in the paper Generating Random Unlabelled Graphs.

Technologies

Project is created with the programming language Java.

Setup

To run this project, download it locally to get the results.

About

Algorithm developed for the research paper “Lights Out on Nearly Complete Graphs”

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages