That's NOT how it's used in chess. Even though the notion of chess position might include some game state information
like side to move, castling rights, and en-passent capturability, I've NEVER seen it include the set of all previous board states, as would be necessary for applying the 3-fold repetition rule in the game's future.
The 386356909593 games do account for superko. That is exactly the number of simple (meaning not visiting the same point twice) paths starting from the empty node in the graph in Figure 4 on page 5 of our paper http://tromp.github.io/go/gost...
Without superko, the number of 2x2 games would simply be infinite...
The notion of legal position namely "every group of connected stones of the same color having an empty point adjacent to it" is NOT dependent on any particular choice of go rules.
on solving 2x2 go with various search methods may be helpful. I've lost track of my original 2x2 game counting code but suspect it was a close relative of this code.
If Huawei's code requires anything more than generic gcc, Australia may not be able to verify 100% security, regardless... unless they're given the source code to the compiler as well.
That wouldn't help, since the compiler recognizes its own source as well, and puts the compiler backdoor in the resulting compiler executable.
So the bad compiler source code is only needed initially to create a compromised compiler executable, and can be cleaned up afterwards.
> Soon to be released: The virtual Car(tm). Just hold up your hands like your holding a steering wheel and make motor sound to get anywhere in the world in just minutes!
You mean virtually anywhere in the world, right?
Yes, the target piece (marked <-) has to be
moved to the leftmost column. The optimal
solution takes 40 moves, so I have no idea
where your 20 comes from:-(
Play OriMazes in JavaScript
on
Programming Puzzles
·
· Score: 2, Informative
Orimazes are sliding block puzzles in disguise
where the blocks are all unit size but limited
to either horizontal or vertical movement.
There is only one free spot, so sliding the blocks
is equivalent to moving the free spot, which
gives it the flavor of a maze.
Of course a smart company will realize that
giving in to blackmail will do nothing except
encourage more blackmailing, to the detriment
of the whole industry.
But in order for all companies to take this
stance, it should be made an offense to pay
off blackmailers, subject to heavy fines.
That makes it much easier for a company to
reply to scammers "i'm sorry, we'd love to
pay you for your lack of services, but uncle
sam won't let us."
Such a law would be much more effective than
a similar one for kidnappings and ransom, as
it becomes more of a pure business decision
rather than a moral and emotional dillema.
Slashdot Mirror
One of my major gripes about slashdot is that it doesn't allow editing of one's comments.
PLEASE LET US EDIT!
This 8 move game disproves your claim:
. .
. .
A2
X .
. .
B1
X .
. O
A1
X .
X O
B2
. O
. O
A1
. O
X O
A2
O O
. O
A1
. .
X .
B2
. O
X .
A2
X O
X .
pass
pass
Btw, we're counting all games, not just games without mistakes.
You might want to learn how to play Go:-)
That's NOT how it's used in chess.
Even though the notion of chess position might include some game state information
like side to move, castling rights, and en-passent capturability,
I've NEVER seen it include the set of all previous board states, as would be necessary
for applying the 3-fold repetition rule in the game's future.
And the number of legal chess positions is in between the number of legal 9x9 Go positions and the number of legal 10x10 Go positions...
2x2 is Go played on a 2x2 board.
where the 4 corners are the playable points.
A game can continue for dozens of moves.
You mean 3^(19*19), a MUCH bigger number.
Yes, I counted the number of possible board states, which I call positions.
You propose to instead use the word position to describe the complete game state including set of previously visited board positions.
I say that's really confusing.
The 386356909593 games do account for superko.
That is exactly the number of simple (meaning not visiting the same point twice) paths starting
from the empty node in the graph in Figure 4 on page 5 of our paper http://tromp.github.io/go/gost...
Without superko, the number of 2x2 games would simply be infinite...
The notion of legal position namely "every group of connected stones of the same color having an empty point adjacent to it" is NOT dependent on any particular choice of go rules.
Only legality of moves is...
Author here.
A single 2x2 game can visit as many as 48 of the 57 legal 2x2 positions, with many dozens of passes in between moves, and obviously many captures.
This page
http://tromp.github.io/java/go...
on solving 2x2 go with various search methods may be helpful. I've lost track of my original 2x2 game counting code but suspect it was a close relative of this code.
The only position not having a color-swapped sibling is the empty position...
"to a doggy day care"
I originally read that as "dodgy day care" ...
-John
Obfuscated C is unreadable, obfuscated Perl is completely impenetrable, but what I want to see is obfuscated Lisp.
Then you clearly overlooked this Common Lisp entry:
http://www.ioccc.org/2005/mikeash/hint.text
Last year's winners also included some obfuscated lambda calculus programs, like a 167-bit prime number generator.
-John
Has the USPTO presented specific examples of what they consider to be excellent software patents? That should help focus discussion...
If Huawei's code requires anything more than generic gcc, Australia may not be able to verify 100% security, regardless... unless they're given the source code to the compiler as well.
That wouldn't help, since the compiler recognizes its own source as well, and puts the compiler backdoor in the resulting compiler executable. So the bad compiler source code is only needed initially to create a compromised compiler executable, and can be cleaned up afterwards.
Where is the best programming language on the Tiobe index? might be the Ultimate question of Life, the Universe, and Everything.
> Soon to be released: The virtual Car(tm). Just hold up your hands like your holding a steering wheel and make motor sound to get anywhere in the world in just minutes! You mean virtually anywhere in the world, right?
"having been invented in Japan, according to tradition, by the emperor Yao, 2350 B.c"
--Yao was a Chinese emperor.
"19 horizontal and 9 vertical lines, making 361 intersections"
--math is tough:(
"he player enclosing the greater number of vacant points being the winner."
--one's score in Go consists both of occupied and surrounded points (or, almost equivalently, of surrounded points one's captured stones)
"This game is played in England upon a board divided into 361 squares, the men being placed upon these instead of upon the intersections."
--I've never heard of this...
regards,
-John
The optimal solution takes 40 moves, so I have no idea where your 20 comes from:-(
See also the paper I wrote about it at http://www.cwi.nl/~tromp/orimaze.html
-John
The hardest 4x4 instance can be played at
http://www.cwi.nl/~tromp/oriscript4.html
while the hardest 5x5 instance is at
http://www.cwi.nl/~tromp/oriscript5.html
-John
Covering 30 numbers per byte and precomputing all the bit-indices, one arrives at: http://www.cwi.nl/~tromp/pearls.html#sieve
Of course a smart company will realize that giving in to blackmail will do nothing except encourage more blackmailing, to the detriment of the whole industry. But in order for all companies to take this stance, it should be made an offense to pay off blackmailers, subject to heavy fines. That makes it much easier for a company to reply to scammers "i'm sorry, we'd love to pay you for your lack of services, but uncle sam won't let us." Such a law would be much more effective than a similar one for kidnappings and ransom, as it becomes more of a pure business decision rather than a moral and emotional dillema.
It is not the shortest infinite loop in combinatory logic though;
there exists one only half as long...
regards,
-John
They can however easily go on for 206*2**155, or about 10**49 moves, as explained on
http://senseis.xmp.net/?path=Speculation&page=Numb erOfPossibleOutcomesOfAGame
-John