Tord Romstad wrote:http://en.wikipedia.org/wiki/.30-06_SpringfieldDann Corbit wrote: {snip}30'06 on what? The 10,000 meter? That's an amazingly fast time.Similarly for trying to run down a deer. I can tell you for sure, I will give out long before the deer does. But he won't outrun my 30'06, which is good enough for me.
New Search Method(s)
Moderators: hgm, Rebel, chrisw
-
- Posts: 12538
- Joined: Wed Mar 08, 2006 8:57 pm
- Location: Redmond, WA USA
Re: New Search Method(s)
-
- Posts: 1808
- Joined: Wed Mar 08, 2006 9:19 pm
- Location: Oslo, Norway
Re: New Search Method(s)
Dann Corbit wrote:http://en.wikipedia.org/wiki/.30-06_Springfield
Thanks for the explanation, guys. You can't expect a poor European to know what a 30'06 is. We don't own a lot of weapons, you know.
-
- Posts: 6401
- Joined: Thu Mar 09, 2006 8:30 pm
- Location: Chicago, Illinois, USA
Re: New Search Method(s)
You rent?????Tord Romstad wrote:Dann Corbit wrote:http://en.wikipedia.org/wiki/.30-06_Springfield
Thanks for the explanation, guys. You can't expect a poor European to know what a 30'06 is. We don't own a lot of weapons, you know.
Miguel
-
- Posts: 13447
- Joined: Wed Mar 08, 2006 9:02 pm
- Location: Dallas, Texas
- Full name: Matthew Hull
Re: New Search Method(s)
In your condition, a few weeks training would get you 3 miles in 24 minutes, which is an 8 minute mile pace. I don't consider that a jogging pace. If I can do that in my late 40's (and I can) there is little doubt in my mind someone who can click off a 51 second quarter mile could manage it with relative ease and only a little training just 3 times a week.Tord Romstad wrote:I'm fairly sure they aren't. Most healthy young humans are perhaps (but I'm far from sure of it) capable of jogging 40 kilometers with sufficient training, but only people with exceptional talent can hope to run such distances.Don wrote:Most humans are easily capable of running 40 kilometer with training assuming their weight is normal
I regard myself as fairly fit. I'm 180 cm tall (5ft 11) and weigh about 77 kg (170 lbs) with very little body fat, and I can run the 400 in about 51 seconds. But there is absolutely no chance that I could ever manage to run anywhere remotely close to 40 km. I guesstimate that the maximum distance I could run, given sufficient training, would be somewhere between 800 and 1000 meters. For anything longer than that, it would be jogging or walking.
But I agree 40 clicks would be much tougher at anything faster than jogging.
Matthew Hull
-
- Posts: 173
- Joined: Sun May 11, 2008 7:43 am
Re: New Search Method(s)
Very simplistic, yet you say no one has figured it out, right?That is all _very_ simplistic, and unfortunately no one has yet come even close to figuring out how a human does much of what you suggest. Much more important is "how do you narrow the list of moves you consider down to 2 or 3 at the most? That will take a lifetime to answer. And that is just one question out of many that we (as humans) can answer quickly, without knowing _how_ we answer it quickly. Until we do, implementation in a chess engine is impossible.
All it comes down too, is many, many condition statements returning true or false. The trojan attack or stonewall, are just some examples you've used. The more conditions the better, for root.
-
- Posts: 173
- Joined: Sun May 11, 2008 7:43 am
Re: New Search Method(s)
This is rather a poor condition to use, because it is still most of the time in your book.Michael Sherwin wrote:I wonder if my language was clear enough when trying to describe the example for progress, so I will give a simple position based example.
[D]r1bqk1nr/pppp1ppp/2n5/2b1p3/2B1P3/5N2/PPPP1PPP/RNBQK2R w KQkq - 4 4
Bf1 is not a move worth considering to us humans, but how is a computer also able to determine this? It has to 'look'. A computer can not look at the board like a human does. It has to use search. We already use a reduced null-move search to look at Bf1 and we do determine this way that Bf1 deserves no further attention. But, can this be improved upon? Well, if all the moves that would be rejected by an even more shallow null-move search were played two at a time then a null-move search on top of that preformed still did not lead to an improved eval then it should be safe to prune.
So, in the above diagram, Bf1 combined with Ng1, Ng5 or Nh4 etc., cannot recommend Bf1 then Bf1 is not worth looking at further as no progress can even be threatened with that move.
Now say there was a piece attacking the pawn on g2, "a person could try":
Code: Select all
int white_w_bishop = 1; // 0 = none
int book_closed = 0; // 1 = true
int phase = 1; // start as opening phase
int white_bishop()
{
if(white_w_bishop = 1) // count that it still exists
{
check_phase_of_game();
if(phase = 1)
{
book();
If(book_closed && move_counter <= 40)
{
phase = 2;
check_for_castle();
}
}
If(phase = 2)
{
check_pieces_being_attack();
king_saftey();
defend();
...
}
if(phase = 3)
{
support_pawn();
connect_with_pawn();
...
}
}
return bishop_status;
}
int check_phase_of_game()
{
...
if(book)
{
phase = 1; // opening
}
if(book_closed)
{
phase = 2; // middle or endgame
}
if(book_closed && move_counter > 40)
{
phase = 3;
}
return phase;
}
int check_pieces_being_attacked()
{
check_phase_of_game();
opponent_attacks();
king_safety();
...
}
int opponent_attacks()
{
if(a1 = 1)
defend();
...
if(g2 = 1)
defend();
if(g2 != 1)
gameplan();
...
}
int defend()
{
defenders_available();
if(defender = 1)
support_attacked();
capture_attacker();
move_attacked_away();
block_attacker();
...
}
int support_attacked()
{
//g2 = 1 //being attacked
castle(); //can we castle to defend?
if(pawn[f2])
f2 = 1; //capable of supporting if moved g2g3
if(pawn[h2])
h2 = 1; //capable of supporting if moved g2g3
if(g1 = 0) //open, use as supporting sq.
gameplan();
if(rook[h1])
h1 = 1;
if(e2 = 0)
gameplan();
if(f1 = 0)
gameplan();
if(d3 = 0)
gameplan();
if(w_bishop[c4])
c4 = 1;
...
}
int gameplan()
{
...
// pawn[g2] being attacked
c4 = 1; //useful piece
g1 = 1; //useful sq
h1 = 1; // useful piece
f2 = 1; // useful piece, pawn supporter
h2 = 1; // useful piece, pawn supporter
f1 = 0; //open sq
e2 = 0;
d3 = 0;
}
int move_list()
{
...
castling[x]; // if possible, try first.
pawn_moves[x]; // g2g3
bishop_moves[x]; // if x = sq[0], bishop can move to
// c4f1 or Bf1
rook_moves[x]; // h1g1
...
}
-
- Posts: 3196
- Joined: Fri May 26, 2006 3:00 am
- Location: WY, USA
- Full name: Michael Sherwin
Re: New Search Method(s)
I keep forgetting that it is human nature to attack the example with out trying to understand the idea behind it.
You are trying to program every conceivable notion as to how humans make PROGRESS towards a goal. My idea generalizes those notions into a simple 'truth'. Only moves at high enough remaining depth that pass a much more rigorous (but quicker do to drastically reduced depth requirements) null move examination are then made in the main search. The rest are pruned, because there is no way they can lead to a better score.
I'm going to take my dog for a run, now.
You are trying to program every conceivable notion as to how humans make PROGRESS towards a goal. My idea generalizes those notions into a simple 'truth'. Only moves at high enough remaining depth that pass a much more rigorous (but quicker do to drastically reduced depth requirements) null move examination are then made in the main search. The rest are pruned, because there is no way they can lead to a better score.
I'm going to take my dog for a run, now.
If you are on a sidewalk and the covid goes beep beep
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
-
- Posts: 3196
- Joined: Fri May 26, 2006 3:00 am
- Location: WY, USA
- Full name: Michael Sherwin
Re: New Search Method(s)
I admit that some very intriguing questions have been raised in this thread. And sense I like to stay on topic as much as possible I have the following suggestion to shed more light on the issue. In this years Iditerod we should have a team of chess programmers pull a dog on a sled!
If you are on a sidewalk and the covid goes beep beep
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
Just step aside or you might have a bit of heat
Covid covid runs through the town all day
Can the people ever change their ways
Sherwin the covid's after you
Sherwin if it catches you you're through
-
- Posts: 5106
- Joined: Tue Apr 29, 2008 4:27 pm
Re: New Search Method(s)
I know you are wrong about this. Most healthy young humans who are in good shape still cannot "run" several miles because they are never called upon to do so and in todays society committing to this training is a big inconvenience.Tord Romstad wrote:I'm fairly sure they aren't. Most healthy young humans are perhaps (but I'm far from sure of it) capable of jogging 40 kilometers with sufficient training, but only people with exceptional talent can hope to run such distances.Don wrote:Most humans are easily capable of running 40 kilometer with training assuming their weight is normal
But any healthy relatively young person can be trained to run (not jog) a marathon - it isn't that much about talent. I guarantee that if each person less than 40 years old was guaranteed 1 million dollars for running 10 miles at 8 minute pace or faster, you would see the majority of these people collecting that prize.
My best time was 62 seconds, but this tells me a lot about you. 51 is really quite fast. I think it might even win some small high school meets in this country.
I regard myself as fairly fit. I'm 180 cm tall (5ft 11) and weigh about 77 kg (170 lbs) with very little body fat, and I can run the 400 in about 51 seconds.
I read somewhere that Bill Rodgers the famous marathon runner could not run a quarter mile much faster than 1 minute. Different people are better suited to different distances, a world class 100 meter runner will never be a world class marathoner for instance. So you basically have a lot of foot speed but you are not ideally suited for distance. But I think if you trained for it you could still easily run it - of course it was be foolish to sprint it.
I am curious about whether you have a good mile time? I discovered in my own case that I could predict my times at almost any distance by using world record times as a point of reference. For instance the 400 meter record is is about 5.18 times faster than the mile record. In my case that was very accurate but at longer distances I tended to exceed this by more, for instance my half marathon time was several seconds per mile faster than this formula would predict. Using this metric I think you would be expected to be able to run a mile in a very respectable 4:24 seconds or so. The mile these days is considered a long sprint, so this may not be that far off the mark for you, especially if you prepared yourself a bit beforehand.
But there is absolutely no chance that I could ever manage to run anywhere remotely close to 40 km. I guesstimate that the maximum distance I could run, given sufficient training, would be somewhere between 800 and 1000 meters. For anything longer than that, it would be jogging or walking.
-
- Posts: 10276
- Joined: Thu Mar 09, 2006 12:37 am
- Location: Tel-Aviv Israel
Re: New Search Method(s)
I think that Tord does not consider running one mile slightly faster than 8 minutes as running but as jogging.