Main

related bits

0

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-09-30 00:48:27

expired found date

-

created at

2024-09-30 00:48:27

updated at

2026-01-26 17:17:29

Domain name statistics

length

36

crc

44375

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

69893241 (blogspot.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

130388

mp size raw text

46831

mp inner links count

96

mp inner links status

20 (imported)

Open Graph

title

Combinatorial Game Theory

description

Combinatorial Game Theory blog. Algorithmic, computational complexity, CGT, abstract games, Nim, Col, Snort, Kayles.

image

site name

author

updated

2026-01-24 22:43:50

raw text

Combinatorial Game Theory skip to main | skip to sidebar Combinatorial Game Theory My CGT musings, with an emphasis on the computational complexity of games. Wednesday, August 7, 2024 The Curious Case of Col's Computational Complexity Col is one of three basic placement games on graphs along with Snort and Node Kayles .  In all three, players take turns painting vertices their color, with a restriction based on what colors are neighboring.  In Col, you can't paint a vertex adjacent to another vertex that already has your color.  In Snort, you can't paint adjacent to a vertex in your opponent's color.  In Node Kayles, you can't paint adjacent to either color.  (That's not usually how Node Kayles is described, but this is equivalent.) Winning Ways mentions these in its discussion of the computational complexity of games.  (It's in Volume 1, chapter 7, "Hackenbush", under "NP-Hardness" as part of the chapter's Extras.)  From Page 224 of the second edition: "Even ...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Other [en] (231)

index version

2025123101

spam phrases

1

Text statistics

text nonlatin

0

text cyrillic

0

text characters

35265

text words

7548

text unique words

1882

text lines

592

text sentences

396

text paragraphs

81

text words per sentence

19

text matched phrases

7

text matched dictionaries

10

RSS

rss status

32 (unknown)

rss found date

2024-09-30 00:48:29

rss size orig

185594

rss items

25

rss spam phrases

4

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

285

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-09-30 00:48:29

sitemap process date

2024-09-30 00:48:30

sitemap first import date

-

sitemap last import date

2025-12-27 22:50:42