Your videos are very helpful. Thankyou!

@MaheshHuddar

Жыл бұрын

Welcome Do like share and subscribe

Excellent explanation.. Good job sir

@MaheshHuddar

10 ай бұрын

Thanks and welcome Do like share and subscribe

Excellent explanation with simple examples...sir

@MaheshHuddar

Жыл бұрын

Thank You Do like share and subscribe

Very nice and clearly explained in this topic tq

@MaheshHuddar

9 ай бұрын

Thank You Do like share and subscribe

Sir whether heuristic search and heuristic function are same or different

Bht shukria ❤❤

@MaheshHuddar

Ай бұрын

Thank You Do like share and subscribe

Sir please make a completed lectures on AI with numericals and previous year Questions like competitive exam

@MaheshHuddar

Жыл бұрын

Yes I will, Please share the questions, I will solve

@souravbhagat1358

Жыл бұрын

Make a vedio on Planning and types of planning in AI. Gaming concept in AI. Agents in AI .knowledge representations. IN AI types and its variation. Like this topic and its numericals portions also if you can this is a great help for me

thank you sir from Canada

@MaheshHuddar

6 ай бұрын

Welcome Do like share and subscribe

Best one ❤️

@MaheshHuddar

2 ай бұрын

Thank You Do like share and subscribe

tnx

@MaheshHuddar

15 күн бұрын

Welcome Do like share and subscribe

nice sir

@MaheshHuddar

Ай бұрын

Thanks and welcome Do like share and subscribe

Instead of doing that, you just can check which child in the next level has least cost and then do it until you reach the goal node. It is quite straight forward.

@-cw5mk

4 ай бұрын

Not least the highest one actually

@pqrstwxyz1175

4 ай бұрын

No actually we use heap to change path in between if needed ...with your approach once a path taken can't be changed

Sir plz share ppt