:: NEWS
02/14/2019
02/13/2019
|| 03/15/2006 ||
strange_science
Richard Kaye's minesweeper page - I managed to prove is that the minesweeper game is essentially equivalent in complexity to any of a wide range of known natural and important problems in the literature called NP-complete problems.
From cw


Add a Comment !
Your Name:
[NOT LOGGED IN]
Comments :

Some BB code is now supported:

Underline Example:

The following comment:

This is an example of an [u]underlined[/u] comment.

Will produce:

This is an example of an underlined comment.

 

Italic Example:

The following comment:

This is an example of a [i]italic[/i] comment.

Will produce:

This is an example of a italic comment.

 

Bold Example:

The following comment:

This is an example of a [b]bold[/b] comment.

Will produce:

This is an example of a bold comment.

 

URL Hyperlink Example:

The following comment:

This is an example of [url=http://www.codewolf.com]a very cool site[/url]

Will produce:

This is an example of a very cool site

 

Also: Line breaks will be treated as a new paragraph