Has anybody tried the Network Truncation Algorithms

[pichy]

http://www.antd.nist.gov/wctg/netanal/EvalNetRel.pdf

[hMx]

http://www.antd.nist.gov/wctg/netanal/EvalNetRel.pdf

Excuse my ignorance... but how does this apply to chess programs?

[melajara]

This is interesting as an analogy, substituting chess concepts for network ones.
However, from p. 9 one can read:

"The networks of interest are tactical radio networks, represented by directed graphs with imperfect vertices (nodes) and edges (links). "

I can substitute an imperfect score with a node defining a chess position for an "imperfect vertex" but what would be an imperfect link?

In chess a move is either legal or not, no fuzziness here and so, IMHO, the analogy and transferability of algorithms devised for network reliability analysis to chess just breaks down.

[mcostalba]

Has anybody tried this ?

http://www.youtube.com/watch?v=YQF38qysPiE

[melajara]

Looks tastier than the network recipe

But don't forget that when she says 450 degrees for 40 minutes in the oven
she means Fahrenheit degrees or circa 220 Celsius

[marcelk]

Has anybody tried this ?

http://www.youtube.com/watch?v=YQF38qysPiE

howdini.com, isn't that recipe a rip-off?

[rbarreira]

Looks tastier than the network recipe

But don't forget that when she says 450 degrees for 40 minutes in the oven
she means Fahrenheit degrees or circa 220 Celsius

Much closer to 230 than 220.

[pichy]

http://www.antd.nist.gov/wctg/netanal/EvalNetRel.pdf

Excuse my ignorance... but how does this apply to chess programs?

It apply to chess programming when you combine it with a game tree search method which is more brute-force and less selective than other popular approaches.

[pichy]

http://www.antd.nist.gov/wctg/netanal/EvalNetRel.pdf

Excuse my ignorance... but how does this apply to chess programs?

It apply to chess programming when you combine it with a game tree search method which is more brute-force and less selective than other popular approaches, some chess programs determine the material balance of a position by a static analysis of all possible capture-move sequences. These routines are often referred to as SOMA (“Swapping Off Material Analyzer”). An enhanced SOMA algorithm with chess-specific features. The general operation of SUPER-SOMA is to calculate a table of all single-square threats and then iteratively cycle through this table, ordering the priority of each tactical move, choosing a move and then updating the table.
The idea is best explained by considering captures around one single square. Cycling through the table produces all moves that are involved in the capture. These moves are usually ordered by their material value. Since pins may be involved, the table should
be updated continuously in order to produce legal moves. One further step is to take into account features such as ‘overloading’. If the first capturing piece is an overloaded Knight and the second piece is a free Rook, then the capture sequence may be re-ordered.
The SUPER-SOMA algorithm allows separate exchanges on the board to be linked and prioritized. In complex positions, with many interrelated exchanges on several squares, the cycle is repeated until neither side can play a beneficial move.

[lucasart]

Has anybody tried this ?

http://www.youtube.com/watch?v=YQF38qysPiE

+1