What is combinatorial complexity.

Question

A chess program that can theoretically play perfectly every game will have high combinatorial complexity.

Answer 1

Was it this one?
https://denrox.com/post/e-type-p-type-s-type-systems
I think this just is an example for a situation where you can not calculate everything, because the possible combinations of possible moves are just too many.
There's the old rice legend about chess which illustrates it pretty well.
Take a look here:
https://en.m.wikipedia.org/wiki/Wheat_and_chessboard_problem

Answer 2

This is a question.. I dont know what combinatorial complexity mean in the sentence i wrote below

Answer 3

I coudnt find any info about this term even on google..

Answer 4

Oh i got it.. Thanks for your help.. I can not tell you how much i appreciate your help😄

Answer 5

This doesn't look like a question, but rather like you're sharing some knowledge of yours.
For this, please use activity feed instead, because this forum is reserved for questions.
https://www.sololearn.com/discuss/1316935/?ref=app

Answer 6

Do you maybe mean 'computational complexity'?
https://en.m.wikipedia.org/wiki/Computational_complexity_theory

Answer 7

No..

Answer 8

Can you give us more info about the context you found this term in?

Answer 9

I was studying types of systems given by manny lehman.. Which are..
S type p type and e type..
And that chess sentence is an example of p type system but coudnt find out what combinatorial complexity mean in that sentence

Answer 10

https://denrox.com/post/e-type-p-type-s-type-systems

Answer 11

This was the article i was reading