Talk:Leash - Revision history

Dptr1988: /* trap detection */ My mistake

2011-01-07T17:45:40Z

‎trap detection: My mistake

Tjr: grammar

2011-01-07T16:23:16Z

grammar

Tjr: formatting

2011-01-07T05:01:04Z

formatting

Tjr at 05:00, 7 January 2011

2011-01-07T05:00:43Z

Dptr1988: /* trap detection */ Reliability is probably dependent on the time you spend in that area ( and never reaches 100% )

2011-01-06T20:01:26Z

‎trap detection: Reliability is probably dependent on the time you spend in that area ( and never reaches 100% )

Tjr: /* trap detection */ new section

2011-01-06T19:50:02Z

‎trap detection: new section

Tjr at 12:00, 26 June 2009

2009-06-26T12:00:55Z

84.229.49.241: Created page with 'I will like to know what does a blessed leash does. --~~~~'

2009-06-26T11:32:05Z

Created page with 'I will like to know what does a blessed leash does. --~~~~'

New page

I will like to know what does a blessed leash does. --[[Special:Contributions/84.229.49.241|84.229.49.241]] 11:32, 26 June 2009 (UTC)

← Older revision		Revision as of 17:45, 7 January 2011
Line 12:		Line 12:
	::The way I read that code is: The pet considers all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine for traps in any direction if it happens to decide on the last tile it considers.		::The way I read that code is: The pet considers all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine for traps in any direction if it happens to decide on the last tile it considers.
	:: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr\|Tjr]] 05:00, 7 January 2011 (UTC)		:: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr\|Tjr]] 05:00, 7 January 2011 (UTC)
		+
		+	:::Yeah, it looks like I grossly misread the pet movement code and just made some incorrect assumptions. Sorry for the noise.
		+	:::--[[User:Dptr1988\|Dptr1988]] 17:45, 7 January 2011 (UTC)

@@ Line 10: / Line 10: @@
 :--[[User:Dptr1988|Dptr1988]] 20:01, 6 January 2011 (UTC)
-::The way I read that code is: The pet goes over all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine traps in any direction if it happens to decide on the last tile it considers.
+::The way I read that code is: The pet considers all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine for traps in any direction if it happens to decide on the last tile it considers.
 :: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr|Tjr]] 05:00, 7 January 2011 (UTC)

← Older revision		Revision as of 05:01, 7 January 2011
Line 11:		Line 11:

	::The way I read that code is: The pet goes over all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine traps in any direction if it happens to decide on the last tile it considers.		::The way I read that code is: The pet goes over all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine traps in any direction if it happens to decide on the last tile it considers.
−	: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr\|Tjr]] 05:00, 7 January 2011 (UTC)	+	:: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr\|Tjr]] 05:00, 7 January 2011 (UTC)

← Older revision		Revision as of 05:00, 7 January 2011
Line 9:		Line 9:
	:From what it looks like in the source code ({{sourcecode\|dogmove.c\|659}}), the pet is guranteed to whine if it attempts to step on a trap, but since you can't predict the pet where the pet is going to step, you can't be 100% confident that your pet has covered all nearby squares. So I guess the reliability of this method is dependent on the time you spend with a leashed pet in a certain area, but still could theoretically never find a trap after an infinite number of turns ( assuming the pet's path choice is random ).		:From what it looks like in the source code ({{sourcecode\|dogmove.c\|659}}), the pet is guranteed to whine if it attempts to step on a trap, but since you can't predict the pet where the pet is going to step, you can't be 100% confident that your pet has covered all nearby squares. So I guess the reliability of this method is dependent on the time you spend with a leashed pet in a certain area, but still could theoretically never find a trap after an infinite number of turns ( assuming the pet's path choice is random ).
	:--[[User:Dptr1988\|Dptr1988]] 20:01, 6 January 2011 (UTC)		:--[[User:Dptr1988\|Dptr1988]] 20:01, 6 January 2011 (UTC)
		+
		+	::The way I read that code is: The pet goes over all adjacent squares until it has decided on its next move. For each square, it first whines if there is a trap, and then draws a one-in-available-tiles chance of moving there. So I think it's guaranteed to whine traps in any direction if it happens to decide on the last tile it considers.
		+	: I believe it always goes through the list of neighboring tiles in the same order. That means it should have a 100% chance of whining if there is a trap in the starting direction; 7/8 chance in the next direction etc. The big caveat is: I don't fully understand the pet movement code. --[[User:Tjr\|Tjr]] 05:00, 7 January 2011 (UTC)

← Older revision		Revision as of 20:01, 6 January 2011
Line 6:		Line 6:

	How reliable is a leashed pet at detecting traps? My own experience finding polymorph traps in the mines tells me it's the most effective method, short of using a crystal ball or gold detection. Are there hard numbers on this subject? --[[User:Tjr\|Tjr]] 19:50, 6 January 2011 (UTC)		How reliable is a leashed pet at detecting traps? My own experience finding polymorph traps in the mines tells me it's the most effective method, short of using a crystal ball or gold detection. Are there hard numbers on this subject? --[[User:Tjr\|Tjr]] 19:50, 6 January 2011 (UTC)
		+
		+	:From what it looks like in the source code ({{sourcecode\|dogmove.c\|659}}), the pet is guranteed to whine if it attempts to step on a trap, but since you can't predict the pet where the pet is going to step, you can't be 100% confident that your pet has covered all nearby squares. So I guess the reliability of this method is dependent on the time you spend with a leashed pet in a certain area, but still could theoretically never find a trap after an infinite number of turns ( assuming the pet's path choice is random ).
		+	:--[[User:Dptr1988\|Dptr1988]] 20:01, 6 January 2011 (UTC)

← Older revision		Revision as of 19:50, 6 January 2011
Line 2:		Line 2:

	: It won't get cursed as fast by spellcasting monsters. Apart from that, there is no difference to uncursed. -[[User:Tjr\|Tjr]] 12:00, 26 June 2009 (UTC)		: It won't get cursed as fast by spellcasting monsters. Apart from that, there is no difference to uncursed. -[[User:Tjr\|Tjr]] 12:00, 26 June 2009 (UTC)
		+
		+	== trap detection ==
		+
		+	How reliable is a leashed pet at detecting traps? My own experience finding polymorph traps in the mines tells me it's the most effective method, short of using a crystal ball or gold detection. Are there hard numbers on this subject? --[[User:Tjr\|Tjr]] 19:50, 6 January 2011 (UTC)

← Older revision		Revision as of 12:00, 26 June 2009
Line 1:		Line 1:
	I will like to know what does a blessed leash does. --[[Special:Contributions/84.229.49.241\|84.229.49.241]] 11:32, 26 June 2009 (UTC)		I will like to know what does a blessed leash does. --[[Special:Contributions/84.229.49.241\|84.229.49.241]] 11:32, 26 June 2009 (UTC)
		+
		+	: It won't get cursed as fast by spellcasting monsters. Apart from that, there is no difference to uncursed. -[[User:Tjr\|Tjr]] 12:00, 26 June 2009 (UTC)