Comments by vickalan
After reading these comments I became curious what graphic set is used for Chess with different armies (the version shown on this thread). I couldn't find out. Does anyone know?
Thanks Fergus,
It looks like there's a big set of Alfaerie graphics. I was looking for a war machine icon that I saw somewhere, and i was able to find it. In fact, there's a few versions. I appreciate it.
Thanks! :)
I've thought about adding the feature to Trappist-1 (version of Chess on an Infinite Plane). It will help correspondence games go faster when only one move is played per day. Of course it also changes the strategy. The opening and mid-game will go-by faster, and then the final "clash" can be much more damaging.
I just installed chessV and I already really like it a lot! It uploads quickly, and installed with no problems. It seems like an awesome program. I like how games are categorized, making it easy to find games, and includes an index with each game's history. Great work! I'm gonna really enjoy using it!
(I also saw Aurelian's Enep on it too!)
Edited pages: 3
Forfnibakking
Fibnif
mAW
fFbW
Fibnif plus Rook
B4nD
N2R4
Forfnifurlrurking
A huygens is chess piece that jumps in the directions of a rook any prime number of squares. In this discussion, I also impose the limit that it has a minimum jump distance of 5 or more squares (as it is used in Trappist-1 ).
So this huygens jumps distances of 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97... and so on. Its icons are shown here:
Icon 1 - by Fergus Duniho.
Icon 2 - Scientific Version
Just like a knight sometimes has trouble moving to a certain square (like requiring 4 jumps to move to a square 2 squares up and 2 left), moving a huygens can also take a few jumps to move to certain squares. Moving an odd number of squares can be tricky if the number isn't prime, because the sum of two primes is always even (unless one of the numbers is 2, but the huygens here can't jump 2 squares). So in these cases, a huygens needs to make 3 jumps to get to a particular square.
When moving an even number of squares, I think it would usually take 2 jumps. But I don't know if there is a way to prove this for every even-numbered move. It is currently unknown if every even integer can be expressed as the sum of two primes. In the 1700's Christian Goldbach believed it was true but couldn't prove it. Today it is still an unsolved problem and is known as the Goldbach Conjecture.
So if you are playing a game of chess with the huygens, don't always assume that you can move an even number of squares in two jumps. There may be some rare cases where three jumps are required. But shorter moves are usually not a problem to figure out. Here's a summary I believe is usually true:
If the distance is prime (5 or more) the huygens can move there in one jump.
If the distance is even, the huygens can get there in two jumps (always or almost always true)
If the distance is odd and not prime, it will require three jumps
The list below shows how to do it for distances up to 40. This may not include every possible method for each distance. For some short moves, it is necessary to overjump the destination, and them move back.
(Move/Leap distances to make the move):
1 (5,7,-11)
2 (7,-5)
3 (5,11,-13)
4 (11,-7)
5 (5)
6 (11,-5)
7 (7)
8 (13,-5)
9 (5,11,-7)
10 (5,5) or (17,-7)
11 (11)
12 (5,7)
13 (13)
14 (7,7)
15 (5,5,5)
16 (5,11)
17 (17)
18 (5,13) or (7,11)
19 (19)
20 (7,13)
21 (7,7,7)
22 (5,17) or (11,11)
23 (23)
24 (5,19) or (7,17) or (11,13)
25 (5,7,13)
26 (7,19) or (13,13)
27 (5,11,11) or (5,5,17) or (7,7,13)
28 (5,23) or (11,17)
29 (29)
30 (7,23) or (11,19) or (13,17)
31 (31)
32 (13,19)
33 (11,11,11)
34 (17,17) or (11,23)
35 (11,11,13)
36 (17,19)
37 (37)
38 (11,11,11,5)
39 (13,19,7)
40 (11,29) or (17,23)
If anyone finds an error or a faster way for any of these moves please leave a reply.
Is this maneuvering problem similar to the knight's tour problem (first discussed in the 9th century)?
Yup, It seems to work now.
I was even able to add graphics to one of my recent posts.
Thanks Fergus!
I've heard of some of those sequences, but not all of them. I had to look up the pancake numbers.
For example, for 4 pancakes, there's 3 ways it might be in an unorganized stack so that it requries 4 flips with a spatula to organize it (from large to small), 11 that require 3, 6 for 2, 3 for 1, and 1 for 0. So a 4 pancake stack gives a pancake sequence of 3, 11, 6, 3, and 1. (Or 1, 3, 6, 11, 3 in reverse order).
But I don't understand the pancake sequence that you showed. It's not a sequence for any stack of pancakes. Am I not on the right path to what a pancake sequence is? Were some pancakes burned and thrown away? Let me know!
That's funny. Pancake numbers can come from two ways: stacking them and cutting them! It's making me hungry.
I'll eat and then enjoy web-surfing to learn more about some of the other number sequences you listed!
Merging Chinese chess with Western chess was a very ambitious thing to do (altering two orthodox traditions) but I think you've succeeded! I like how you took the plain round disks and replaced them with chess pieces that are easier to discrimate. Good work on this interesting variant!
OK, today I'll study the lucky numbers, and the wierd numbers from George Duke. (Possible new chess pieces for large chessboards and infinite chess).
I like the Lucky numbers. Once a number is stricken from the list, it can never be added back. The lucky ones remain!
Fergus, Ben, Greg, what's the normal amount of time for CVP to decide if material (such as below, which I also submited at "Post your own Games") can be added to the Piececlopedia or as a side-article?
I know you guys are working on the CKEditor. But the material I posted is pre-formatted, displays correctly, and is ready to go.
The only question is if Fergus is OK with the huygens having his "pyramid" artwork to be used as a piece shape. (If not, then the scientific design can be the primary piece shape).
The article I wrote is complete, but I would also be completelly fine with anyone adding to it, and then it being posted with two authors.
It's time for CVP to have a new piece added to Piececlopedia. It's been awhile since the last one!
Since this comment is for a page that has not been published yet, you must be signed in to read it.
Hi Fergus, I'm sorry - I did recieve your e-mail this morning but didn't realize you had sent it. To answer your questions about infinite chess, there are currently a few games in progress and some of them are on public game forums. (One game is a team competition between two groups, with one move being declared about every two days). Infinite chess is also being discussed on math forums, because of how it affects the ability of chess to be analyzed by game theory, and chess-playing software.
I did delete your graphic from my submission, because I will of course respect your artwork if you don't want it used for the huygens.
I also added a mention of Hans Bodlaender, and a link to a page where he discussed infinite chess in 2001. (As you know Hans was very innovative, and it's good to see the current team of editors for CVP continue to carry on his tradition).
I understand that the Piececlopedia is for pieces with a long tradition, so I understand you may not want it included there. But I hope you will make the article about the huygens visible to the public, so that these pages continue to be useful to people who might want to learn more about Infinite Chess, and the pieces that are used with it.
As always, I really appreciate your support.
At one chess-playing forum, there are at least two games of my version "Chess on an Infinite Plane" being played. One of them is a team competition (3 players vs. 3 players). Another game in-progress is called "Chess on an Infinite Plane with Huygens Option" which is the same as Trappist-1 (a game described here at CVP).
Also, the huygens has received attention among the math community. An example is at the StackExchange Talk Forum, and also at the Talk Page of Joel Hamkins "A position in infinite chess with game value ω^4".
Please let me know if you'd like me to show any specific links.
Thanks as always Fergus,
25 comments displayed
Permalink to the exact comments currently displayed.
OK, thanks for answering. In a few weeks I might try ChessV.
I noticed the package includes Fairy-Max. Does ChessV and Fairy-Max share any code, or are they distinct programs?
Regards, :)